Hyperequivalence of logic programs with respect to supported models

Annals of Mathematics and Artificial Intelligence (Impact Factor: 0.69). 08/2008; 53(1-4):331-365. DOI: 10.1007/s10472-009-9119-8
Source: DBLP


Recent research in nonmonotonic logic programming has focused on certain types of program equivalence, which we refer to here
as hyperequivalence, that are relevant for program optimization and modular programming. So far, most results concern hyperequivalence relative
to 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 the autoepistemic logic of Moore. In this paper,
we consider a family of hyperequivalence relations for programs based on the semantics of supported and supported minimal models. We characterize these relations
in model-theoretic terms. We use the characterizations to derive complexity results concerning testing whether two programs
are hyperequivalent relative to supported and supported minimal models.

Full-text preview

Available from:
  • Source
    Article: Lebenslauf

    Preview · Article ·
  • Source

    Preview · Conference Paper · Jan 2008
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In Answer-Set 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 Here-and-There (HT). For uniform equivalence however, correct characterizations in terms of HT-models 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 HT-models and countermodels (so-called equivalence interpretations), which are lifted to first-order 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 non-ground logic programs. In particular, uniform equivalence coincides under open and ordinary answer-set semantics, and for finite non-ground programs under these semantics, also the usual characterization of uniform equivalence in terms of maximal and total HT-models of the grounding is correct, even for infinite domains, when corresponding ground programs are infinite.
    Preview · Article · Dec 2008 · Lecture Notes in Computer Science
Show more