检索结果-内蒙古大学图书馆

Optimum stable model search: algorithms and implementation

JOURNAL OF LOGIC AND COMPUTATION 2020年第4期30卷 863-897页

作者： Alviano, Mario Dodaro, Carmine Marques-Silva, Joao Ricca, Francesco Univ Calabria Dept Math & Comp Sci I-87036 Arcavacata Di Rende Italy Univ Coll Dublin CASL Dublin Ireland

answer set programming (ASP) is a well-known declarative problem solving paradigm developed in the field of nonmonotonic reasoning and logic programming. The usual target of ASP is the solution of combinatorial search problems, nonetheless the language of ASP was extended with weak constraints for concise modelling of optimization problems. In the case of ASP programs with weak constraints, the main computational task of an ASP solver is optimum stable model search. In this article, we present and compare several algorithms for optimum stable model search. We consider solutions traditionally adopted by ASP solvers, and we introduce new solving strategies obtained by porting to the ASP setting some algorithms that were introduced for Maximum Satisfiability solving. The article also reports on the implementation of these algorithms in the ASP solver WASP. An empirical analysis highlights pros and cons of different strategies for computing optimum stable models.

关键词： answer set programming ASP maximum satisfiability MaxSAT optimization problems WASP core-guided algorithms model-guided algorithms

来源：评论

学校读者我要写书评

暂无评论

Data repair of inconsistent nonmonotonic description logic programs

引用

ARTIFICIAL INTELLIGENCE 2016年第0期239卷 7-53页

作者： Eiter, Thomas Fink, Michael Stepanova, Dania Vienna Univ Technol Inst Informat Syst Vienna Austria

Combining Description Logic (DL) ontologies and nonmonotonic rules has gained increasing attention in the past decade, due to the growing range of applications of DLs. A well-known proposal for such a combination are non-monotonic DL-programs, which support rule based reasoning on top of DL ontologies in a loose coupling, using a well-defined query interface. However, inconsistency may easily arise as a result of the interaction of the rules and the ontology, such that no answer set (i.e., model) of a DL-program exists;this makes the program useless. To overcome this problem, we present a framework for repairing inconsistencies in DL-programs by exchanging formulas of an ontology formulated DL-Lite(A), which is a prominent DL that allows for tractable reasoning. Viewing the data part of the ontology as a source of inconsistency, we define program repairs and repair answer sets based on them. We analyze the complexity of the notion, and we extend an algorithm for evaluating DL-programs to compute repair answer sets, under optional selection of preferred repairs that satisfy additional constraints. The algorithm induces a generalized ontology repair problem, in which the entailment respectively non-entailment of queries to the ontology, subject to possible updates, must be achieved by a data change. While this problem is intractable in general, we identify several tractable classes of preferred repairs that are useful in practice. For the class of deletion repairs among them, we optimize the algorithm by reducing query evaluation to constraint matching, based on the novel concept of support set, which roughly speaking is a portion of the data from which entailment of an ontology query follows. Our repair approach is implemented within an answer set program system, using a declarative method for repair computation. An experimental evaluation on a suite of benchmark problems shows the effectiveness of our approach and promising results, both regarding performance and qu

关键词： Rules and ontologies answer set programming Description logics Inconsistency management Nonmonotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

CNL2ASP: Converting Controlled Natural Language Sentences into ASP

引用

THEORY AND PRACTICE OF LOGIC programming 2024年第2期24卷 196-226页

作者： Caruso, Simone Dodaro, Carmine Maratea, Marco Mochi, Marco Riccio, Francesco Univ Genoa DIBRIS Genoa Italy Univ Calabria DeMaCS Arcavacata Di Rende Italy ALTEN Italia Engn Div Turin Italy

answer set programming (ASP) is a popular declarative programming language for solving hard combinatorial problems. Although ASP has gained widespread acceptance in academic and industrial contexts, there are certain user groups who may find it more advantageous to employ a higher-level language that closely resembles natural language when specifying ASP programs. In this paper, we propose a novel tool, called CNL2ASP, for translating English sentences expressed in a controlled natural language (CNL) form into ASP. In particular, we first provide a definition of the type of sentences allowed by our CNL and their translation as ASP rules and then exemplify the usage of the CNL for the specification of both synthetic and real-world combinatorial problems. Finally, we report the results of an experimental analysis conducted on the real-world problems to compare the performance of automatically generated encodings with the ones written by ASP practitioners, showing that our tool can obtain satisfactory performance on these benchmarks.

关键词： answer set programming logic programming controlled natural language

来源：评论

学校读者我要写书评

暂无评论

Metric Temporal Equilibrium Logic over Timed Traces

引用

THEORY AND PRACTICE OF LOGIC programming 2024年第3期24卷 425-452页

作者： Becker, Arvid Cabalar, Pedro Dieguez, Martin Schaub, Torsten Schuhmann, Anna Univ Potsdam Potsdam Germany Univ A Coruna La Coruna Spain Univ Angers LERIA Angers France

In temporal extensions of answer set programming (ASP) based on linear time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. However, timing constraints are important in many applications like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers. The resulting Metric Equilibrium Logic (MEL) provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. To this end, we define a translation of metric formulas into monadic first-order formulas and give a correspondence between their models in MEL and Monadic Quantified Equilibrium Logic, respectively. Interestingly, our translation provides a blue print for implementation in terms of ASP modulo difference constraints.

关键词： answer set programming metric temporal logic equilibrium logic non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Experimenting with parallelism for the instantiation of ASP programs

引用

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC 2008年第1-3期63卷 34-54页

作者： Calimeri, F. Perri, S. Ricca, F. Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende CS Italy

In the last few years, microprocessor technologies have been moving towards multi-core architectures, in order to improve performance as well as reduce power consumption. This makes real Symmetric MultiProcessing (SMP) available even on nondedicated machines, and paves the way to the development of better performing software. Notably, the recent application of answer set programming (ASP) in different emerging areas, such as knowledge management or information extraction/integration, shows that performance is a crucial issue also for ASP systems. Among the tasks performed by such systems, the instantiation process, which consists of generating a variable-free program equivalent to the input one, is one of the most expensive from a computational viewpoint, especially in the case of huge input data. In this paper a new strategy exploiting parallelism for the instantiation of ASP programs is proposed. An implementation of this strategy and its integration with the grounding module of the DLV system is discussed. The results of an experimental analysis are also presented, which confirm that the strategy is effective in making ASP instantiation more efficient. (c) 2008 Elsevier Inc. All fights reserved.

关键词： answer set programming Disjunctive Logic programming instantiation parallelism

来源：评论

学校读者我要写书评

暂无评论

Detecting Malware Activities With MalpMiner: A Dynamic Analysis Approach

引用

IEEE ACCESS 2023年 11卷 84772-84784页

作者： Abdelwahed, Mustafa F. Kamal, Mustafa M. Sayed, Samir G. Helwan Univ Fac Engn Dept Comp & Syst Engn Cairo 11792 Egypt Natl Telecom Regulatory Author NTRA Egyptian Comp Emergency Readiness Team EG CERT Cairo 12971 Egypt Helwan Univ Fac Engn Dept Elect & Commun Engn Cairo 11792 Egypt

Day by day, malware as a service becomes more popular and easy to acquire, thus allowing anyone to start an attack without any technical background, which in turn introduces challenges for detecting such attacks. One of those challenges is the detection of malware activities early to prevent harm as much as possible. This paper presents a trusted dynamic analysis approach based on answer set programming (ASP), a logic engine inference named Malware-Logic-Miner (MalpMiner). ASP is a nonmonotonic reasoning engine built on an open-world assumption, which allows MalpMiner to adopt commonsense reasoning when capturing malware activities of any given binary. Furthermore, MalpMiner requires no prior training;therefore, it can scale up quickly to include more malware-attack attributes. Moreover, MalpMiner considers the invoked application programming interfaces' values, resulting in correct malware behaviour modelling. The baseline experiments prove the correctness of MalpMiner related to recognizing malware activities. Moreover, MalpMiner achieved a detection ratio of 99% with a false-positive rate of less than 1% while maintaining low computational costs and explaining the detection decision.

关键词： Cybersecurity artificial intelligence answer set programming malware behaviour detec-tion logic programming emulation

来源：评论

学校读者我要写书评

暂无评论

An Application of a Runtime Epistemic Probabilistic Event Calculus to Decision-making in e-Health Systems

引用

THEORY AND PRACTICE OF LOGIC programming 2023年第5期23卷 1070-1093页

作者： D'asaro, Fabio Aurelio Raggioli, Luca Malek, Salim Grazioso, Marco Rossi, Silvia Univ Verona Dept Human Sci Ethos Grp Verona Italy Univ Naples Federico II Dept Elect Engn & Informat Technol Naples Italy

We present and discuss a runtime architecture that integrates sensorial data and classifiers with a logic-based decision-making system in the context of an e-Health system for the rehabilitation of children with neuromotor disorders. In this application, children perform a rehabilitation task in the form of games. The main aim of the system is to derive a set of parameters the child's current level of cognitive and behavioral performance (e.g., engagement, attention, task accuracy) from the available sensors and classifiers (e.g., eye trackers, motion sensors, emotion recognition techniques) and take decisions accordingly. These decisions are typically aimed at improving the child's performance by triggering appropriate re-engagement stimuli when their attention is low, by changing the game or making it more difficult when the child is losing interest in the task as it is too easy. Alongside state-of-the-art techniques for emotion recognition and head pose estimation, we use a runtime variant of a probabilistic and epistemic logic programming dialect of the Event Calculus, known as the Epistemic Probabilistic Event Calculus. In particular, the probabilistic component of this symbolic framework allows for a natural interface with the machine learning techniques. We overview the architecture and its components, and show some of its characteristics through a discussion of a running example and experiments.

关键词： e-health logic programming answer set programming sensor fusion motor rehabilitation

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of aggregate functions in the DLV system

引用

THEORY AND PRACTICE OF LOGIC programming 2008年第5-6期8卷 545-580页

作者： Faber, Wolfgang Pfeifer, Gerald Leone, Nicola Dellarmi, Tina Ielpa, Giuseppe Univ Calabria Dept Math I-87036 Cosenza Italy

Disjunctive logic programming (DLP) is a very expressive formalism. It allows for expressing every property of finite structures that is decidable in the complexity class Sigma(P)(2) (=NPNP). Despite this high expressiveness, there are some simple properties, often arising in real-world applications, which cannot be encoded in a simple and natural manner. Especially properties that require the use of arithmetic operators (like sum, times, or count) on a set or multiset of elements, which satisfy some conditions, cannot be naturally expressed in classic DLP. To overcome this deficiency, we extend DLP by aggregate functions in a conservative way. In particular, we avoid the introduction of constructs with disputed semantics, by requiring aggregates to be stratified. We formally define the semantics of the extended language (called DLPA), and illustrate how it can be profitably used for representing knowledge. Furthermore, we analyze the computational complexity of DLPA, showing that the addition of aggregates does not bring a higher cost in that respect. Finally, we provide an implementation of DLPA in DLV-a state-of-the-art DLP system-and report on experiments which confirm the usefulness of the proposed extension also for the efficiency of computation.

关键词： disjunctive logic programming answer set programming aggregates knowledge representation implementation

来源：评论

学校读者我要写书评

暂无评论

Effectively solving NP-SPEC encodings by translation to ASP

引用

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE 2015年第5期27卷 577-601页

作者： Alviano, Mario Faber, Wolfgang Univ Calabria Dept Math & Comp Sci I-87036 Cosenza Italy Univ Huddersfield Sch Comp & Engn Huddersfield HD1 3DH W Yorkshire England

NP-SPEC is a language for specifying problems in NP in a declarative way. Despite the fact that the semantics of the language was given by referring to Datalog with circumscription, which is very close to answer set programming (ASP), so far the only existing implementations are by means of (ECLPSe)-P-i Prolog and via Boolean satisfiability solvers. In this paper, we present translations from NP-SPEC to ASP, and provide an experimental evaluation of existing implementations and the proposed translations into ASP using various ASP solvers. The results show that translating into ASP clearly has an edge over the existing translation into SAT, which involves an intrinsic grounding process. We also argue that it might be useful to incorporate certain language constructs of NP-SPEC into mainstream ASP.

关键词： answer set programming knowledge representation NP-SPEC declarative programming

来源：评论

学校读者我要写书评

暂无评论

A Distributed Approach to LARS Stream Reasoning (System paper)

引用

THEORY AND PRACTICE OF LOGIC programming 2019年第5-6期19卷 974-989页

作者： Eiter, Thomas Ogris, Paul Schekotihin, Konstantin Tech Univ Wien Inst Log & Computat KBS Grp Vienna Austria Alpen Adria Univ Klagenfurt Austria

Stream reasoning systems are designed for complex decision-making from possibly infinite, dynamic streams of data. Modern approaches to stream reasoning are usually performing their computations using stand-alone solvers, which incrementally update their internal state and return results as the new portions of data streams are pushed. However, the performance of such approaches degrades quickly as the rates of the input data and the complexity of decision problems are growing. This problem was already recognized in the area of stream processing, where systems became distributed in order to allocate vast computing resources provided by clouds. In this paper we propose a distributed approach to stream reasoning that can efficiently split computations among different solvers communicating their results over data streams. Moreover, in order to increase the throughput of the distributed system, we suggest an interval-based semantics for the LARS language, which enables significant reductions of network traffic. Performed evaluations indicate that the distributed stream reasoning significantly outperforms existing stand-alone LARS solvers when the complexity of decision problems and the rate of incoming data are increasing.

关键词： Stream reasoning distributed systems answer set programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：