Strong and uniform equivalence of nonmonotonic theories - An algebraic approach

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

We show that the concepts of strong and uniform equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong and uniform equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic.

Original languageEnglish
Pages (from-to)245-265
Number of pages21
JournalAnnals of Mathematics and Artificial Intelligence
Volume48
Issue number3-4
DOIs
StatePublished - Dec 2006

Bibliographical note

Funding Information:
This work was partially supported by the NSF grant IIS-0325063.

Keywords

  • Autoepistemic logic
  • Default logic
  • Nonmonotonic theories

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Strong and uniform equivalence of nonmonotonic theories - An algebraic approach'. Together they form a unique fingerprint.

Cite this