Article
Hyperequivalence of logic programs with respect to supported models.
Annals of Mathematics and Artificial Intelligence (Impact Factor: 0.49). 01/2008; 53:331365. DOI: 10.1007/s1047200991198
Source: DBLP

Conference Paper: Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs.
[Show abstract] [Hide abstract]
ABSTRACT: Over the years, the stablemodel semantics has gained a position of the correct (twovalued) interpretation of default negation in programs. However, for programs with aggregates (constraints), the stablemodel semantics, in its broadly accepted generalization stemming from the work by Pearce, Ferraris and Lifschitz, has a competitor: the semantics proposed by Faber, Leone and Pfeifer, which seems to be essentially different. Our goal is to explain the relationship between the two semantics. Pearce, Ferraris and Lifschitz's extension of the stablemodel semantics is best viewed in the setting of arbitrary propositional theories. We propose an extension of the FaberLeonePfeifer semantics, or FLP semantics , for short, to the full propositional language, which reveals both common threads and differences between the FLP and stablemodel semantics. We establish several properties of the FLP semantics. We apply a similar approach to define supported models for arbitrary propositional theories.Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 1417, 2009. Proceedings; 01/2009  [Show abstract] [Hide abstract]
ABSTRACT: In AnswerSet Programming different notions of equivalence, such as the prominent notions of strong and uniform equivalence, have been studied and characterized by various selections of models in the logic of HereandThere (HT). For uniform equivalence however, correct characterizations in terms of HTmodels can only be obtained for finite theories, respectively programs. In this paper, we show that a selection of countermodels in HT captures uniform equivalence also for infinite theories. This result is turned into coherent characterizations of the different notions of equivalence by countermodels, as well as by a mixture of HTmodels and countermodels (socalled equivalence interpretations), which are lifted to firstorder theories under a very general semantics given in terms of a quantified version of HT. We show that countermodels exhibit expedient properties like a simplified treatment of extended signatures, and provide further results for nonground logic programs. In particular, uniform equivalence coincides under open and ordinary answerset semantics, and for finite nonground programs under these semantics, also the usual characterization of uniform equivalence in terms of maximal and total HTmodels of the grounding is correct, even for infinite domains, when corresponding ground programs are infinite.01/2008;  [Show abstract] [Hide abstract]
ABSTRACT: Equivalence and generality relations over logic programs have been proposed in answer set programming to semantically compare information contents of logic programs. In this paper, we overview previous relations of answer set programs, and propose a general framework that subsumes previous relations. The proposed framework allows us to compare programs possibly having nonminimal answer sets as well as to explore new relations between programs. Such new relations include relativized variants of generality relations over logic programs. By selecting contexts for comparison, the proposed framework can represent weak, strong and uniform variants of generality, inclusion and equivalence relations. These new relations can be applied to comparison of abductive logic programs and coordination of multiple answer set programs.04/2011: pages 91110;
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.
Miroslaw Truszczynski 