We report on preliminary research towards native algorithms for query answering over relational nonmonotonic Multi-Context Systems (MCS), i.e., algorithms that do not rely on computing equilibria. Inspired by techniqu...
详细信息
ISBN:
(纸本)9783642405648
We report on preliminary research towards native algorithms for query answering over relational nonmonotonic Multi-Context Systems (MCS), i.e., algorithms that do not rely on computing equilibria. Inspired by techniques for query answering in distributed answer set programming, we identify MCS settings where a generalized query answering algorithm is effective and efficient;confirmed by a preliminary evaluation on a real world application.
Answer set programming (ASP) is a declarative programming paradigm stemming from logicprogrammingthat has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications ...
详细信息
ISBN:
(纸本)9783642405648
Answer set programming (ASP) is a declarative programming paradigm stemming from logicprogrammingthat has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications still pose a challenge that is commonly referred to as grounding bottleneck. Devising, implementing, and evaluating a method that alleviates this problem for certain application domains is the focus of this paper. the proposed method is based on combining backtracking-based search algorithms employed in answer set solvers with SLDNF resolution from PROLOG. Using PROLOG inference on non-ground portions of a given program, both grounding time and the size of the ground program can be substantially reduced.
We propose a history-based approximation of the Possible Worlds Semantics (PWS) for reasoning about knowledge and action. A respective planning system is implemented by a transformation of the problem domain to an Ans...
详细信息
ISBN:
(纸本)9783642405648
We propose a history-based approximation of the Possible Worlds Semantics (PWS) for reasoning about knowledge and action. A respective planning system is implemented by a transformation of the problem domain to an Answer-Set Program. the novelty of our approach is elaboration tolerant support for postdiction under the condition that the plan existence problem is still solvable in NP, as compared to Sigma(P)(2) for non-approximated PWS of Son and Baral [20]. We demonstrate our planner with standard problems and present its integration in a cognitive robotics framework for high-level control in a smart home.
there are many different notions of "rule" in the literature. A key feature and main intuition of any such notion is that rules can be "applied" to derive conclusions from certain premises. More fo...
详细信息
ISBN:
(纸本)9783642405648
there are many different notions of "rule" in the literature. A key feature and main intuition of any such notion is that rules can be "applied" to derive conclusions from certain premises. More formally, a rule is viewed as a function that, when invoked on a set of known facts, can produce new facts. In this paper, we show that this extreme simplification is still sufficient to obtain a number of useful results in concrete cases. We define abstract rules as a certain kind of functions, provide them with a semantics in terms of (abstract) stable models, and explain how concrete normal logicprogramming rules can be viewed as abstract rules in a variety of ways. We further analyse dependencies between abstract rules to recognise classes of logic programs for which stable models are guaranteed to be unique.
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.
acthex programs are a convenient tool for connecting stateful external environments to logic programs. In the acthex framework, actual actions on an external environment can be declaratively selected, rearranged, sche...
详细信息
ISBN:
(纸本)9783642405648
acthex programs are a convenient tool for connecting stateful external environments to logic programs. In the acthex framework, actual actions on an external environment can be declaratively selected, rearranged, scheduled and then executed depending on intelligence specified in an ASP-based language. We report in this paper about recent improvements of the formal and of the operational acthex programming framework. Besides yielding a significant increase in versatility of the framework, we also present illustrative application showcases and a short evaluation thereof exhibiting computational acthex strengths.
We propose a novel conceptual approach to program updates implementation that exploits two features of tabling in logicprogramming (in XSB Prolog): incremental and answer subsumption tabling. Our approach, EVOLP/R, i...
详细信息
ISBN:
(纸本)9783642405648
We propose a novel conceptual approach to program updates implementation that exploits two features of tabling in logicprogramming (in XSB Prolog): incremental and answer subsumption tabling. Our approach, EVOLP/R, is based on the constructs of Evolving logic Programs (EVOLP), but simplifies it at first by restricting updates to fluents only. Rule updates are nevertheless achieved via the mechanism of rule name fluents, placed in rules' bodies, permitting to turn rules on or off, through assertions or retractions of their corresponding unique name fluents. Incremental tabling of fluents allows to automatically maintain - at engine level - the consistency of program states. Answer subsumption of fluents addresses the frame problem - at engine level - by automatically keeping track of their latest assertion or retraction. the implementation is detailed here to the extent that it may be exported to other logicprogramming tabling systems.
the broader goal of our research is to formulate answers to why and how questions with respect to knowledge bases, such as AURA. One issue we face when reasoning with many available knowledge bases is that at times ne...
详细信息
ISBN:
(纸本)9783642405648
the broader goal of our research is to formulate answers to why and how questions with respect to knowledge bases, such as AURA. One issue we face when reasoning with many available knowledge bases is that at times needed information is missing. Examples of this include partially missing information about next sub-event, first sub-event, last sub-event, result of an event, input to an event, destination of an event, and raw material involved in an event. In many cases one can recover part of the missing knowledge through reasoning. In this paper we give a formal definition about how such missing information can be recovered and then give an ASP implementation of it. We then discuss the implication of this with respect to answering why and how questions.
Criteria for measuring economic inequality, such as the Lorenz curve and the Gini index, are widely used in the social sciences but have hardly been explored in Multia-gent Systems, even though the significance of oth...
详细信息
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.
暂无评论