Strong equivalence for logic programs and default theories (Made Easy)

Hudson Turner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Scopus citations

Abstract

Logic programs P and Q are strongly equivalent if, given any logic program R, programs P ∩ R and Q ∩ R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Recently, Lifschitz, Pearce and Valverde showedthat Heyting's logic of here-and-there can be used to characterize strong equivalence of logic programs. This paper offers a more direct characterization, and extends it to default logic. In their paper, Lifschitz, Pearce and Valverde study a very general form of logic programs, called" nested" programs. For the study of strong equivalence of default theories, it is convenient to introduce a corresponding "nested" version of default logic, which generalizes Reiter's default logic.

Original languageEnglish (US)
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR 2001, Proceedings
Pages81-92
Number of pages12
DOIs
StatePublished - 2001
Event6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001 - Vienna, Austria
Duration: Sep 17 2001Sep 19 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2173 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2001
CountryAustria
CityVienna
Period9/17/019/19/01

Fingerprint

Dive into the research topics of 'Strong equivalence for logic programs and default theories (Made Easy)'. Together they form a unique fingerprint.

Cite this