Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Proofs and types
Foundations of logic programming
Principles of knowledge representation
Reasoning agents in dynamic domains
Logic-based artificial intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
Journal of Automated Reasoning
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Diagnosing Physical Systems in A-Prolog
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Characterization of strongly equivalent logic programs in intermediate logics
Theory and Practice of Logic Programming
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Applications of intuitionistic logic in Answer Set Programming
Theory and Practice of Logic Programming
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Annals of Mathematics and Artificial Intelligence
Updates in answer set programming: An approach based on basic structural properties
Theory and Practice of Logic Programming
Discovering classes of strongly equivalent logic programs
Journal of Artificial Intelligence Research
Sound and complete inference rules for SE-consequence
Journal of Artificial Intelligence Research
Strong equivalence for logic programs with preferences
IJCAI'05 Proceedings of the 19th international joint conference on Artificial 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
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A possibilistic intuitionistic logic
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
An implementation for recognizing rule replacements in non-ground answer-set programs
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Analysing and extending well-founded and partial stable semantics using partial equilibrium logic
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Inductive equivalence of logic programs
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Possibilistic semantics for logic programs with ordered disjunction
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Dealing with explicit preferences and uncertainty in answer set programming
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We study the notion of strong equivalence between two Answer Set programs and we show how some particular cases of testing strong equivalence between programs can be reduced to verify if a formula is a theorem in intuitionistic or classical logic. We present some program transformations for disjunctive programs, which can be used to simplify the structure of programs and reduce their size. These transformations are shown to be of interest for both computational and theoretical reasons. Then we propose how to generalize such transformations to deal with free programs (which allow the use of default negation in the head of clauses). We also present a linear time transformation that can reduce an augmented logic program (which allows nested expressions in both the head and body of clauses) to a program consisting only of standard disjunctive clauses and constraints.