Strong and uniform equivalence of nonmonotonic theories – an algebraic approach
- 31 May 2007
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 48 (3-4) , 245-265
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Semantical characterizations and complexity of equivalences in answer set programmingACM Transactions on Computational Logic, 2007
- Uniform Equivalence of Logic Programs under the Stable Model SemanticsLecture Notes in Computer Science, 2003
- Uniform semantic treatment of default and autoepistemic logicsArtificial Intelligence, 2002
- Fixpoint semantics for logic programming a surveyTheoretical Computer Science, 2002
- Strongly equivalent logic programsACM Transactions on Computational Logic, 2001
- Approximations, Stable Operators, Well-Founded Fixpoints and Applications in Nonmonotonic Reasoning2000
- Bilattices and the semantics of logic programmingThe Journal of Logic Programming, 1991
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Multivalued logics: a uniform approach to reasoning in artificial intelligenceComputational Intelligence, 1988
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985