We show that the concepts of strong and uniform equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong and un...
详细信息
this paper introduces techniques for updating knowledge bases represented in extended logic programs. three different types of updates, view updates, theory updates, and inconsistency removal, are considered. We formu...
详细信息
ISBN:
(纸本)3540667490
this paper introduces techniques for updating knowledge bases represented in extended logic programs. three different types of updates, view updates, theory updates, and inconsistency removal, are considered. We formulate these updates through abduction, and provide methods for computing them with update programs. An update program is an extended logic program which specifies changes on abductive hypotheses, then updates are computed by the U-minimal answer sets of an update program. the proposed technique provides a uniform framework for these different types of updates, and each update is computed using existing procedures of logicprogramming.
We present the action language GC+ for reasoning about actions in multi-agent systems under probabilistic uncertainty and partial observability, which is an extension of the action language C+ that is inspired by part...
详细信息
ISBN:
(纸本)3540285385
We present the action language GC+ for reasoning about actions in multi-agent systems under probabilistic uncertainty and partial observability, which is an extension of the action language C+ that is inspired by partially observable stochastic games (POSGs). We provide a finite-horizon value iteration for this framework and show that it characterizes finite-horizon Nash equilibria. We also describe how the framework can be implemented on top of nonmonotonic causal theories. We then present acyclic action descriptions in GC+ as a special case where transitions are computable in polynomial time. We also give an example that shows the usefulness of our approach in practice.
this paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via if technique known as superoptimisation. Answer...
详细信息
ISBN:
(纸本)9783642042379
this paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via if technique known as superoptimisation. Answer set programming (ASP) is utilised as the modelling and computational framework for searching over the large. complex search spaces and for proving the functional equivalence of two code sequences. Experimental results are given showing the progress made in solver performance over the previous few years, along with an Outline Of future developments to the system and applications within compiler toolchanis.
this paper investigates a new approach for computing the inference of defeasible logic. the algorithm proposed can substantially reduced the theory size increase due to transformations while preserving the representat...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
this paper investigates a new approach for computing the inference of defeasible logic. the algorithm proposed can substantially reduced the theory size increase due to transformations while preserving the representation properties in different variants of DL. Experiments also show that our algorithm outperform traditional approach by several order of amplitudes.
In this paper we generalize the notion of approximation of action theories introduced in [ 13,26]. We introduce a logicprogramming based method for constructing approximation of action theories of AL and prove its so...
详细信息
ISBN:
(纸本)3540285385
In this paper we generalize the notion of approximation of action theories introduced in [ 13,26]. We introduce a logicprogramming based method for constructing approximation of action theories of AL and prove its soundness. We describe an approximation based conformant planner and compare its performance with other state-of-the-art conformant planners.
the paper presents DLV(+)a Disjunctive logicprogramming system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV+ is built on top of DLV (a state-of-the art DLP syste...
详细信息
ISBN:
(纸本)3540285385
the paper presents DLV(+)a Disjunctive logicprogramming system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV+ is built on top of DLV (a state-of-the art DLP system), and provides a graphical user interface that allows to specify, update, browse, query, and reason on knowledge bases. Two strong points of the system are the powerful type-checking mechanism, and the advanced interface for visual querying.
In general, the set of stable models of a recursive propositional logic program can be quite complex. For example, it follows from results of Marek, Nerode, and Remmel [8] that there exists finite predicate logic prog...
详细信息
ISBN:
(纸本)3540667490
In general, the set of stable models of a recursive propositional logic program can be quite complex. For example, it follows from results of Marek, Nerode, and Remmel [8] that there exists finite predicate logic programs and recursive propositional logic programs which have stable models but no hyperarithmetic stable models. In this paper, we shall define several conditions which ensure that recursive logic program has astable model which is recursive.
We study logic programs with arbitrary abstract constraint atoms, called c-atoms. As a theoretical means to analyze program properties, we investigate the possibility of unfolding these programs to logic programs comp...
详细信息
ISBN:
(纸本)9783540721994
We study logic programs with arbitrary abstract constraint atoms, called c-atoms. As a theoretical means to analyze program properties, we investigate the possibility of unfolding these programs to logic programs composed of ordinary atoms. this approach reveals some structural properties of a program with c-atoms, and enables characterization of these properties based on the known properties of the transformed program. Furthermore, this approach leads to a straightforward definition of answer sets for disjunctive programs with c-atoms, where a c-atom may appear in the head of a rule as well as in the body. We also study the complexities for various classes of logic programs with c-atoms.
Defeasible Description logics (DDLs) can state defeasible concept inclusions and often use rational closure according to the KLM postulates for reasoning. If in DDLs with quantification a defeasible sub-sumption relat...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Defeasible Description logics (DDLs) can state defeasible concept inclusions and often use rational closure according to the KLM postulates for reasoning. If in DDLs with quantification a defeasible sub-sumption relationship holds between concepts, it can also hold if these concepts appear nested in existential restrictions. Earlier reasoning algorithms did not detect this kind of relationships. We devise a new form of canonical models that extend classical ones for EL. by elements that satisfy increasing amounts of defeasible knowledge and show that reasoning w.r.t. these models yields the missing rational entailments.
暂无评论