Strong equivalence of nonmonotonic theories-an algebraic approach (abstract)

Research output: Contribution to conferencePaperpeer-review

Abstract

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

Original languageEnglish
StatePublished - 2006
Event9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006 - Fort Lauderdale, FL, United States
Duration: Jan 4 2006Jan 6 2006

Conference

Conference9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006
Country/TerritoryUnited States
CityFort Lauderdale, FL
Period1/4/061/6/06

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Strong equivalence of nonmonotonic theories-an algebraic approach (abstract)'. Together they form a unique fingerprint.

Cite this