Answering realistic questions about biological systems and pathways similar to text book questions used for testing students' understanding of such systems is one of our long term research goals. Often these quest...
详细信息
ISBN:
(纸本)9783642405648
Answering realistic questions about biological systems and pathways similar to text book questions used for testing students' understanding of such systems is one of our long term research goals. Often these questions require simulation based reasoning. In this paper, we show how higher level extensions of Petri Nets, such as colored tokens can be encoded in Answer Set programming, thereby providing the right formalisms to model and reason about such questions with relative ease. Our approach can be adapted to other domains.
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.
Intensional logicprogramming is an extension of logicprogramming based on intensional logic, which includes as special cases both temporal and modal logicprogramming. In [OW92], M. Orgun and W. W. Wadge provided a ...
详细信息
ISBN:
(纸本)9783642405648
Intensional logicprogramming is an extension of logicprogramming based on intensional logic, which includes as special cases both temporal and modal logicprogramming. In [OW92], M. Orgun and W. W. Wadge provided a general framework for capturing the semantics of intensional logicprogramming languages. One key property involved in the construction of [OW92], is the monotonicity of intensional operators. In this paper we consider intensional logicprogramming from a game-theoretic perspective. In particular we define a two-person game and we demonstrate that it is equivalent to the semantics of [OW92]. More importantly, we demonstrate that the game is even applicable to intensional languages with non-monotonic operators. In this way we provide the first (to our knowledge) general semantic framework for capturing the semantics of non-monotonic intensional logicprogramming.
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.
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.
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.
作者：
Benhamou, Belaïd
Domaine univ. S. Jerome Ave. Escadrille Normandie Niemen 13397 Marseille Cedex 20 France
Université d'Artois SP 18 Rue Jean Souvraz F 62307 Lens Cedex France
Many research works had been done in order to define a semantics for logic programs. the well know is the stable model semantics which selects for each program one of its canonical models. the stable models of a logic...
详细信息
the proceedings contain 55 papers. the topics discussed include: integrating temporal extensions of answer set programming;the fourth answer set programming competition: preliminary report;WASP: a native ASP solver ba...
ISBN:
(纸本)9783642405631
the proceedings contain 55 papers. the topics discussed include: integrating temporal extensions of answer set programming;the fourth answer set programming competition: preliminary report;WASP: a native ASP solver based on constraint learning;symbolic system synthesis using answer set programming;accurate computation of sensitizable paths using answer set programming;encoding higher level extensions of Petri nets in answer set programming;Cplus2ASP: computing action language C+ in answer set programming;event-object reasoning with curated knowledge bases: deriving missing information;towards query answering in relational multi-context systems;spectra in abstract argumentation: an analysis of minimal change;an ASP application in integrative biology: identification of functional gene units;extending the metabolic network of ectocarpus siliculosus using answer set programming;and efficient approximation of well-founded justification and well-founded domination.
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.
暂无评论