Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Annals of Mathematics and Artificial Intelligence
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Discovering classes of strongly equivalent logic programs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Complexity of rule redundancy in non-ground answer-set programming over finite domains
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Reducing propositional theories in equilibrium logic to logic programs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Quantified Equilibrium Logic and Foundations for Answer Set Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
A normal form for linear temporal equilibrium logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Theory and Practice of Logic Programming
Exploring relations between answer set programs
Logic programming, knowledge representation, and nonmonotonic reasoning
Back and forth between rules and SE-models
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
The modal logic of equilibrium models
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
| Hi-index | 0.00 |
We consider the problem of obtaining aminimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a method consisting in the generation of the set of prime implicates of the original theory, starting from its set of countermodels (in the logic of Here-and-There), in a similar vein to the Quine-McCluskeymethod forminimisation of boolean functions. As a side result, we also provide several results about fundamental rules (those that are not tautologies and do not contain redundant literals) which are combined to build the minimal programs. In particular, we characterise their form, their corresponding sets of countermodels, as well as necessary and sufficient conditions for entailment and equivalence among them.