A characterization of strong equivalence for logic programs with variables

Authors:
Vladimir Lifschitz;David Pearce;Agustín Valverde
Affiliations:
Department of Computer Sciences, University of Texas at Austin;Computing Science and Artificial Intelligence, Univ. Rey Juan Carlos, Móstoles, Madrid, Spain;Dept. of Applied Mathematics, Univ. of Málaga, Spain
Venue:
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Year:
2007

Citing 7
Cited 25

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Extending and implementing the stable model semantics

Artificial Intelligence
A New Logical Characterisation of Stable Models and Answer Sets

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Characterization of strongly equivalent logic programs in intermediate logics

Theory and Practice of Logic Programming
Strong and uniform equivalence in answer-set programming: characterizations and complexity results for the non-ground case

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Answer sets for propositional theories

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

Strongly Equivalent Temporal Logic Programs

JELIA '08 Proceedings of the 11th European conference on Logics 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
Partial Functions and Equality in Answer Set Programming

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
Program Correspondence under the Answer-Set Semantics: The Non-ground Case

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Safe Formulas in the General Theory of Stable Models (Preliminary Report)

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Revised Concept of Safety for General Answer Set Programs

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A reductive semantics for counting and choice in answer set programming

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
Quantified equilibrium logic and hybrid rules

RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Logic programming for knowledge representation

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Minimal logic programs

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Logic-based ontology comparison and module extraction, with an application to DL-Lite

Artificial Intelligence
A logical semantics for description logic programs

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Stable models and circumscription

Artificial Intelligence
A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there*

Theory and Practice of Logic Programming
Functional answer set programming

Theory and Practice of Logic Programming
Exploring relations between answer set programs

Logic programming, knowledge representation, and nonmonotonic reasoning
Termination of grounding is not preserved by strongly equivalent transformations

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Synonymous theories and knowledge representations in answer set programming

Journal of Computer and System Sciences
Datalog programs and their stable models

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Equivalence between extended datalog programs -- a brief survey

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Interpolable formulas in equilibrium logic and answer set programming

Journal of Artificial Intelligence Research
Relational theories with null values and non-herbrand stable models

Theory and Practice of Logic Programming
FQHT: the logic of stable models for logic programs with intensional functions

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two sets of rules are said to be strongly equivalent to each other if replacing one by the other within any logic program preserves the program's stable models. The familiar characterization of strong equivalence of grounded programs in terms of the propositional logic of here-and-there is extended in this paper to a large class of logic programs with variables. This class includes, in particular, programs with conditional literals and cardinality constraints. The first-order version of the logic of here-and-there required for this purpose involves two additional non-intuitionistic axiom schemas.