We explore the use, of Constraint;Lopic programming (CLP) as a platform for experimenting with planning domains ill presence of multiple interacting agents. We develop a novel constraint-based action language B-MAP th...
详细信息
ISBN:
(纸本)9783642042379
We explore the use, of Constraint;Lopic programming (CLP) as a platform for experimenting with planning domains ill presence of multiple interacting agents. We develop a novel constraint-based action language B-MAP that enables the declarative description of large classes of multi-agent and multi-valued domains. B-MAP supports several complex features, including combined effects. concurrency constraint, interacting actions,. mid delayed effects.
We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. this novel language allows users to elegantly express non-trivial, multi-...
详细信息
this paper reports on systematic research which aims to classify non-monotonic logics by their expressive power. the classification is based on translation functions that satisfy three important criteria: polynomialit...
详细信息
ISBN:
(纸本)3540667490
this paper reports on systematic research which aims to classify non-monotonic logics by their expressive power. the classification is based on translation functions that satisfy three important criteria: polynomiality, faithfulness and modularity (PFM for short). the basic method for classification is to prove that PFM translation functions exist (or do not exist) between certain logics. As a result, non-monotonic logics can be arranged to form a hierarchy. this paper gives an overview of the current expressive power hierarchy (EPH) and investigates semi-normal default logic as well as prerequisite-free and semi-normal default logic in order to locate their exact positions in the hierarchy.
In this paper we introduce a logicprogramming based framework which allows the representation of conditional non-monotonic temporal beliefs and goals in a declarative way. We endow it with stable model like semantics...
详细信息
ISBN:
(纸本)9783642405648
In this paper we introduce a logicprogramming based framework which allows the representation of conditional non-monotonic temporal beliefs and goals in a declarative way. We endow it with stable model like semantics that allows us to deal with conflicting goals and generate possible alternatives. We show that our framework satisfies some usual properties on goals and that it allows imposing alternative constraints on the interaction between beliefs and goals. We prove the decidability of the usual reasoning tasks and show how they can be implemented using an ASP solver and an LTL reasoner in a modular way, thus taking advantage of existing LTL reasoners and ASP solvers.
the advantages of FLORID as a deductive object-oriented databaSe system are the rich object-oriented modeling facilities of its language Flogic. the focus of this paper is on FLORID’S multiple inheritance mechanism w...
详细信息
We introduce an approach to preferences suitable for agents that base decisions on their beliefs. In our work, agents' preferences are perceived as a consequence of their beliefs, but at the same time are used to ...
详细信息
ISBN:
(纸本)9783642405648
We introduce an approach to preferences suitable for agents that base decisions on their beliefs. In our work, agents' preferences are perceived as a consequence of their beliefs, but at the same time are used to feed the knowledge base with beliefs about preferences. As a result, agents can reason with preferences to hypothesize, explain decisions, and review preferences in face of new information. Finally, we integrate utility-based to reasoning-based criteria of decision making.
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitions. We consider ID-logictheories that...
详细信息
ISBN:
(纸本)3540285385
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitions. We consider ID-logictheories that express, at the same time, the two basic challenges in database composition problems: relating different schemas of the local databases to one global schema (schema integration) and amalgamating the distributed and possibly contradictory data to one consistent database (data integration). We show that our framework supports different methods for schema integration (as well as their combinations) and that it provides a straightforward way of dealing with inconsistent data. Moreover, this framework facilitates the implementation of database repair and consistent query answering by means of a variety of reasoning systems.
We introduce the logic-based planning language K-c as an extension of K [5]. K-c has two advantages upon K. First, the introduction of external function calls in the rules of a planning description allows the knowledg...
详细信息
ISBN:
(纸本)9783540721994
We introduce the logic-based planning language K-c as an extension of K [5]. K-c has two advantages upon K. First, the introduction of external function calls in the rules of a planning description allows the knowledge engineer to describe certain planning domains, e.g. involving complex action effects, in a more intuitive fashion then is possible in K. Secondly, in contrast to the conformant planning framework K, K-c is formalized as a conditional planning system, which enables K-c to solve planning problems that are impossible to express in K, e.g. involving sensing actions. A prototype implementation of conditional planning with K-c is build on top of the DLVK system, and we illustrate its use by some small examples.
Several proposals of the semantics of aggregates are based oil different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building upon a reductive approach to designin...
详细信息
ISBN:
(纸本)9783642042379
Several proposals of the semantics of aggregates are based oil different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building upon a reductive approach to designing aggregates, we provide reformulations of some existing semantics in terms of propositional formulas, which help us compare the semanitcs and understand their properties in terms of their propositional formula representations. We also present a generalization of semantics of aggregates without involving grounding, and define loop formulas for programs with aggregates guided by the reductive approach.
logic programs with abstract constraint atoms provide a unifying framework for studying logic programs with various kinds of constraints. Establishing strong equivalence between logic programs is a key property for pr...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
logic programs with abstract constraint atoms provide a unifying framework for studying logic programs with various kinds of constraints. Establishing strong equivalence between logic programs is a key property for program maintenance and optimization, and for guaranteeing the same behavior for a revised original program in any context. In this paper, we study strong equivalence of logic programs with abstract constraint atoms. We first give a general characterization of strong equivalence based on a new definition of program reduct for logic programs with abstract constraints. then we consider a particular kind of program revision-constraint replacements addressing the question: under what conditions can a constraint in a program be replaced by other constraints, so that the resulting program is strongly equivalent to the original one.
暂无评论