Conference Paper

Strongly Equivalent Temporal Logic Programs

DOI: 10.1007/978-3-540-87803-2_3 Conference: Logics in Artificial Intelligence, 11th European Conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008. Proceedings
Source: DBLP

ABSTRACT This paper analyses the idea of strong equivalence for transition systems represented as logic programs under the Answer Set
Programming (ASP) paradigm. To check strong equivalence, we use a linear temporal extension of Equilibrium Logic (a logical
characterisation of ASP) and its monotonic basis, the intermediate logic of Here-and-There (HT). Trivially, equivalence in
this temporal extension of HT provides a sufficient condition for temporal strong equivalence and, as we show in the paper,
it can be transformed into a provability test into the standard Linear Temporal Logic (LTL), something that can be automatically
checked using any of the LTL available provers. The paper shows an example of the potential utility of this method by detecting
some redundant rules in a simple actions reasoning scenario.

Download full-text

Full-text

Available from: Pedro Cabalar, Jul 09, 2015
0 Followers
 · 
106 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: It is twenty years since Michael Gelfond and Vladimir Lifschitz published their celebrated paper on the stable model semantics of logic programs. This has since become one of the most cited works in declarative programming. It led to a new approach to non-monotonic reasoning and eventually paved the way to establish a vibrant new programming paradigm: ASP or answer set programming. In this essay I re-examine the conceptual foundations underlying the approach of stable models and relate them to various developments in logic around the middle of the last Century. I draw some conclusions for the methodology of foundational research in ASP.
    Logic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings; 01/2008
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations are permitted in heads and bodies of rules, as special kinds of theories. In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs into quantified propositional logic, an extension of classical propositional logic where quantifications over atomic formulas are permitted. We provide reductions not only for decision problems, but also for the central semantical concepts of equilibrium logic and nested logic programs. In particular, our encodings map a given decision problem into some formula such that the latter is valid precisely in case the former holds. The basic tasks we deal with here are the consistency problem, brave reasoning, and skeptical reasoning. Additionally, we also provide encodings for testing equivalence of theories or programs under different notions of equivalence, viz. ordinary, strong, and uniform equivalence. For all considered reasoning tasks, we analyse their computational complexity and give strict complexity bounds.
    Theory and Practice of Logic Programming 06/2009; DOI:10.1017/S147106840999010X · 0.90 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the An- swer Set semantics for logic programs to arbirary theories in the syntax of Linear Temporal Logic. It has been already shown that, in the non- temporal case, arbitrary propositional theories can always be reduced to logic program rules (with disjunction and negation in the head) inde- pendently on the context. That is, logic programs constitute a normal form for the non-temporal case. In this paper we show that TEL can be similarly reduced to a normal form consisting of a set of implications (embraced by a necessity operator) quite close to logic program rules. This normal form may be useful both for a practical implementation of TEL and a simpler analysis of theoretical problems.
    Logics in Artificial Intelligence - 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. Proceedings; 01/2010