In this paper we study the relation between the two main extensions of Answer Set programming with temporal modal operators: Temporal Equilibrium logic (TEL) and Temporal Answer Sets (TAS). On the one hand, TEL is a c...
详细信息
ISBN:
(纸本)9783642405648
In this paper we study the relation between the two main extensions of Answer Set programming with temporal modal operators: Temporal Equilibrium logic (TEL) and Temporal Answer Sets (TAS). On the one hand, TEL is a complete non-monotonic logicthat results from the combination of Linear-time Temporal logic (LTL) with Equilibrium logic. On the other hand, TAS is based on a richer modal approach, Dynamic LTL (DLTL), whereas its non-monotonic part relies on a reduct-based definition for a particular limited syntax. To integrate both approaches, we propose a Dynamic Linear-time extension of Equilibrium logic (DTEL) that allows accommodating both TEL and TAS as particular cases. With respect to TEL, DTEL incorporates more expressiveness thanks to the addition of dynamic logic operators, whereas with respect to TAS, DTEL provides a complete non-monotonic semantics applicable to arbitrary theories. In the paper, we identify cases in which both formalisms coincide and explain how this relation can be exploited for adapting existing TEL and TAS computation methods to the general case of DTEL.
Precise knowledge of the longest sensitizable paths in a circuit is crucial for various tasks in computer-aided design, including timing analysis, performance optimization, delay testing, and speed binning. As delays ...
详细信息
ISBN:
(纸本)9783642405648
Precise knowledge of the longest sensitizable paths in a circuit is crucial for various tasks in computer-aided design, including timing analysis, performance optimization, delay testing, and speed binning. As delays in today's nanoscale technologies are increasingly affected by statistical parameter variations, there is significant interest in obtaining sets of paths that are within a length range. For instance, such path sets can be used in the emerging areas of Post-silicon validation and characterization and Adaptive Test. We present an ASP-based method for computing well-defined sets of sensitizable paths within a length range. Unlike previous approaches, the method is accurate and does not rely on a priori relaxations. Experimental results demonstrate the applicability and scalability of our method.
We present a formal framework where a nonmonotonic formalism (the action description language C+) is used to provide robots with high-level reasoning, such as planning, in the style of cognitive, robotics. In particul...
详细信息
ISBN:
(纸本)9783642042379
We present a formal framework where a nonmonotonic formalism (the action description language C+) is used to provide robots with high-level reasoning, such as planning, in the style of cognitive, robotics. In particular, we introduce a novel method that bridges the high-level discrete action planning and the low-level continuous behavior by trajectory planning. We show the applicability of this framework oil two LEGO MINDSTORMS NXT robots, in ail action domain that involves concurrent execution of actions that cannot be serialized.
the purpose of this paper is to provide a brief overview of how logicprogramming technology has been used by our team in addressing the problem of tertiary protein structure determination. the proposed approach tackl...
详细信息
ISBN:
(纸本)9783642042379
the purpose of this paper is to provide a brief overview of how logicprogramming technology has been used by our team in addressing the problem of tertiary protein structure determination. the proposed approach tackles the problem from the perspective of viewing protein structure as a folding of protein sequences in a discrete representation of space (a crystal lattice structure). logicprogramming and constraint programming technologies can be effectively used to provide an elegant and effective Solution.
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to Solutions, and then pick the ones whose weights are over (resp. be...
详细信息
ISBN:
(纸本)9783642042379
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to Solutions, and then pick the ones whose weights are over (resp. below) a threshold. this paper studies Computing weighted Solutions to such problems ill Answer Set programming. We investigate two sorts of methods for computing weighted solutions: one suggests modifying the representation of the problem and the other suggests modifying the search procedure of the answer set solver. We show the applicability and the effectiveness of these methods in phylogeny reconstruction.
this paper presents an approach for specifying user preferences related to services by means of a preference meta-model, which is mapped to logic programs with possibilistic ordered disjunction following a Model-Drive...
详细信息
this paper presents an approach for specifying user preferences related to services by means of a preference meta-model, which is mapped to logic programs with possibilistic ordered disjunction following a Model-Driven Methodology (MDM). MDM allows to specify problem domains by means of meta-models which can be converted to instance models or other meta-models through transformation functions. In particular we propose a preference meta-model that defines an abstract preference specification language allowing users to specify preferences in a more friendly way using models. We also present a meta-model for logic programs with possibilistic order disjunction. then we show how we conceptually map the preference meta-model to logic programs with possibilistic ordered disjunction by means of a mapping function.
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.
this book constitutes the refereed proceedings of the 4thinternationalconference on logicprogramming and nonmonotonicreasoning, lpnmr '97, held in Dagstuhl Castle, Germany, in July 1997.;the volume presents 19...
详细信息
ISBN:
(数字)9783540692492
ISBN:
(纸本)9783540632559
this book constitutes the refereed proceedings of the 4thinternationalconference on logicprogramming and nonmonotonicreasoning, lpnmr '97, held in Dagstuhl Castle, Germany, in July 1997.;the volume presents 19 revised regular papers together with10 system descriptions and five abstracts of invited presentations. the papers included report state-of-the-art research and development in the interdisciplinary area of logicprogramming and logical foundations of artificial intelligence.
We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities...
详细信息
ISBN:
(纸本)9783642042379
We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of programs has a finite representation, and for each of the classes definable in the schema we characterize the complexity of the existence of an answer set problem. Next, we derive similar characterizations of the complexity of skeptical and credulous reasoning with disjunctive logic programs. Such results are of potential interest. Oil the one hand, they reveal some reasons responsible for the hardness of computing answer sets. On the other hand. they identify classes of problem instances, for which the problem is "easy" (in P) or "easier than in general" (in NP).
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.
暂无评论