Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
From Logic to Logic Programming
From Logic to Logic Programming
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
A three-valued characterization for strong equivalence of logic programs
Eighteenth national conference on Artificial intelligence
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Rule Calculus: Semantics, Axioms and Applications
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Relativized Hyperequivalence of Logic Programs for Modular Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Hyperequivalence of logic programs with respect to supported models
Annals of Mathematics and Artificial Intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Relativized hyperequivalence of logic programs for modular programming
Theory and Practice of Logic Programming
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
A possibilistic intuitionistic logic
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Here and there among logics for logic programming
Correct Reasoning
| Hi-index | 0.00 |
The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be verified in 3-valued Gödel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz et al., 2001). In this paper we will show that KC (the logic obtained by adding axiom $\neg A\vee\neg\neg A$ to intuitionistic logic), is the weakest intermediate logic for which strongly equivalent logic programs, in a language allowing negations, are logically equivalent.