We present a logic and logicprogramming based approach for analysing event-based requirements specifications given in terms of, a system's reaction to events and safety properties. the approach uses a variant of ...
详细信息
ISBN:
(纸本)3540439307
We present a logic and logicprogramming based approach for analysing event-based requirements specifications given in terms of, a system's reaction to events and safety properties. the approach uses a variant of Kowalski and Sergot's Event Calculus to represent such specifications declaratively and an abductive reasoning mechanism for analysing safety properties. Given a system description and a safety property, the abductive mechanism is able to identify a complete set of counterexamples (if any exist) of the property in terms of symbolic ''current" states and associated event-based transitions. A case study of an automobile cruise control system specified in the SCR framework is used to illustrate our approach. the technique described is implemented. using existing tools for abductive logicprogramming.
the class of finitary normal logic programs-identified recently, [1]-makes it possible to reason effectively with function symbols, recursion, and infinite stable models. these features may lead to a full integration ...
详细信息
ISBN:
(纸本)3540439307
the class of finitary normal logic programs-identified recently, [1]-makes it possible to reason effectively with function symbols, recursion, and infinite stable models. these features may lead to a full integration of the standard logicprogramming paradigm withthe answer set programming paradigm. For all finitary programs, ground goals axe decidable, while nonground goals are semidecidable. Moreover, the existing engines (that currently accept only much more restricted programs [11,7]) can be extended to handle finitary, programs by replacing their front-ends and keeping their core inference mechanism unchanged. In this paper, the theory of finitary normal programs is extended to disjunctive programs. More precisely, we introduce a suitable generalization of the notion of finitary program and extend all the results of [1] to this class. For this purpose, a consistency result by Fages is extended from normal programs to disjunctive programs. We also correct an error occurring in [1].
We propose a new way of extending logicprogramming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by Constraint LP, on how to extend the reasoning capabilities ...
详细信息
ISBN:
(纸本)3540439307
We propose a new way of extending logicprogramming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by Constraint LP, on how to extend the reasoning capabilities of the LP engine. Unlike other approaches to the field, Pfd syntax can be intuitively related to the axioms defining Probability and to the underlying concepts of Probability theory, (PT) such as sample space, events, and probability function. Probabilistic variables are core computational units and have two parts. Firstly, a finite domain, which at each stage holds the collection of possible values that can be assigned to the variable, and secondly a probabilistic function that can be used to assign probabilities to the elements of the domain. the two constituents are kept in isolation from each other. there are two benefits in such an approach. Firstly, that propagation techniques from finite domains research are retained, since a domain̵7;s representation is not altered. thus, a probabilistic variable continues to behave as a finite domain variable. Secondly, that the probabilistic function captures the probabilistic behaviour of the variable in a manner which is, to a large extent, independent of the particular domain values. the notion of events as used in PT can be captured by LP predicates containing probabilistic variables and the derives operator (⊢) as defined in LP. Pfd stores hold conditional constraints which are a computationally useful restriction of conditional probability from PT. Conditional constraints are defined by D1: π1⊕...⊕Dn: πn | Q1743;...743; Qm where, Di and Qj are predicates and each πi is a probability measure (0 ≤ πi ≤ 1, 1 ≤ i ≤ n, 1 ≤ j ≤ m). the conjuction of Qj̵7;s qualifies probabilistic knowledge about Di<
the proceedings contain 39 papers. the topics discussed include: a computational logic approach to heterogeneous agent systems;on the complexity of model checking and inference in minimal models;data integration needs...
ISBN:
(纸本)3540425934
the proceedings contain 39 papers. the topics discussed include: a computational logic approach to heterogeneous agent systems;on the complexity of model checking and inference in minimal models;data integration needs reasoning;nonmonotonic inductive logicprogramming;on the effect of default negation on the expressiveness of disjunctive rules;on the expressibility of stable logicprogramming;on the relationship between defeasible logic and well-founded semantics;a comparative study of well-founded semantics for disjunctive logic programs;reasoning with open logic programs;representation of incomplete knowledge by induction of default theories;explicitly using default knowledge in concept learning: an extended description logics plus strict and default rules;declarative specification and solution of combinatorial auctions using logicprogramming;and planning with different forms of domain-dependent control knowledge - an answer set programming approach.
nonmonotoniclogicprogramming (NMLP) and inductive logicprogramming (ILP) are two important extensions of logicprogramming. the former aims at representing incomplete knowledge and reasoning with commonsense, while...
详细信息
this paper motivates and introduces entailment problems over nonmonotonictheories some of whose predicates - called open predicates - are not (completely) specified. More precisely, we are interested in those inferen...
详细信息
I report about a particular approach to heterogenous agent systems, IMPACT, which is strongly related to computational logic. the underlying methods and techniques stem from both non-monotonic reasoning and logic prog...
详细信息
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reached about which semantics is the most...
详细信息
Default logic is recognized as a powerful framework for knowledge representation and incomplete information management. Its expressive power is suitable for non monotonic reasoning, but the counterpart is its very hig...
详细信息
the language Ε for reasoning about actions and change can be translated into an argumentation framework. In this paper, we extend this translation of the basic language and showhowit can, together with methods from a...
详细信息
暂无评论