Hyperequivalence of programs and operators

Mirosław Truszczyński, Stefan Woltran

Research output: Contribution to conferencePaperpeer-review


Recent research in nonmonotonic logic programming has focused on different notions of program equivalence relevant for program optimization and modular programming. So far, most results concern the stable-model semantics. However, other semantics for logic programs are also of interest, especially the semantics of supported models which, when properly generalized, is closely related to a prominent non-monotonic formalism, the autoepistemic logic of Moore. In this paper, we consider a framework of equivalence notions for logic programs under the supported (minimal) modelsemantics and provide characterizations for this framework in both model-theoretic and algebraic terms. We then use some of our results in order to obtain characterizations of the equivalence of theories in Moore's autoepistemic logic.

Original languageEnglish
StatePublished - 2008
Event10th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008 - Fort Lauderdale, FL, United States
Duration: Jan 2 2008Jan 4 2008


Conference10th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2008
Country/TerritoryUnited States
CityFort Lauderdale, FL

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics


Dive into the research topics of 'Hyperequivalence of programs and operators'. Together they form a unique fingerprint.

Cite this