Sciweavers

1679 search results - page 3 / 336
» Strong order equivalence
Sort
View
LPNMR
2005
Springer
14 years 2 months ago
Testing Strong Equivalence of Datalog Programs - Implementation and Examples
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
Thomas Eiter, Wolfgang Faber, Patrick Traxler
LPNMR
2007
Springer
14 years 2 months ago
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
Stefan Woltran
LPNMR
2009
Springer
14 years 3 months ago
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
Jörg Pührer, Hans Tompits
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 8 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
JAIR
2007
108views more  JAIR 2007»
13 years 8 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen