The solving of multi-domain constraint problems with the help of collaborating solvers has seen extended interest in recent years. We describe the implementation (Meta-S) and extension of a previously proposed theoret...
详细信息
In this paper, we study the reachability problem for conditional term rewriting systems. Given two ground terms s and t, our practical aim is to prove s &rarrR* t for some join conditional term rewriting system R ...
详细信息
We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended ...
详细信息
We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infinite knowledge. Not only can conceptual logic programs (CLPs) simulate finite answer set programming, they are also flexible enough to simulate reasoning in an expressive class of description logics, thus being able to play the role of ontology language, as well as rule language, on the Semantic Web.
In this paper we present a new framework for runtime verification of properties of real time systems such as financial systems or backend databases. Such a systems has a semantics which resemples that of timed traces,...
详细信息
An overview of today's automotive industry reminds us about an ever-increasing demand for passenger comfort, safety and zero emissions vehicles. Drivers are also seeking improvements in the handling stability at h...
详细信息
We present new complexity results on answer set checking for nonground programs under a variety of syntactic restrictions. For several of these problems, the kind of representation of the answer set to be checked is i...
详细信息
We present new complexity results on answer set checking for nonground programs under a variety of syntactic restrictions. For several of these problems, the kind of representation of the answer set to be checked is important. In particular, we consider set-based and bitmap-based representations, which are popular in implementations of Answer Set programming systems. Furthermore, we present new complexity results for various reasoning tasks under the assumption that predicate arities are bounded by some constant. These results imply that in such a setting - which appears to be a reasonable assumption in practice - more efficient implementations than those currently available may be feasible.
The issues related to designing architectures for agents that need to be able to adapt to changing circumstances during deployment are discussed. This research is being carried out in the context of the Smart Internet...
详细信息
ISBN:
(纸本)9783540399179
The issues related to designing architectures for agents that need to be able to adapt to changing circumstances during deployment are discussed. This research is being carried out in the context of the Smart Internet technology Cooperative Research Center. The first attempt in this project at an architecture involves integrating BDI agent architectures for the reasoning component and reinforcement learning for the learning component. In the research, the learning system used to approximate the Q-function is ALKEMY, a decision-tree learning system with a foundation in higher-order logic.
Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program...
详细信息
Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program's completion [4]. The converse is true when the logic program is "tight" [6,5]. Lin and Zhao [7] showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called "loop formulas". Nevertheless, their solver as sat1 has some disadvantages: it can work only with basic rules, and it can compute only one answer set. Answer set solver CMODELS-12 [12] is a system that computes answer sets for logic programs that are tight or can be transformed into tight programs, and does not suffer from these limitations. We are going to present a new system CMODELS-21, that is able to fix assat's disadvantages. Another attractive feature of the new system is that it organizes the search process more efficiently then as sat, because it does not explore the same part of the search tree more than once. In the rest of the paper we will omit number 2 in the name of the system.
Term rewriting systems (TRSs) extended by allowing to contain extra variables in their rewrite rules are called EV-TRSs. They are ill-natured since every one-step reduction by their rules with extra variables is infin...
详细信息
Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. Sometimes this information is not sufficient for ...
详细信息
Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. Sometimes this information is not sufficient for solving a certain problem. In this paper we define graphs which are suitable for computing answer sets of different classes of logic programs. Intuitively, a graph associated to a logic program is suitable for answer set semantics if its structure is sufficient to compute the answer sets of the corresponding program. That is, algorithms that use suitable graphs do not have to consider the original logic program any longer. We investigate different classes of graphs which are suitable for answer set computation of normal nested logic programs, normal logic programs and normal programs with at most on positive body atom.
暂无评论