Relativized hyperequivalence of logic programs for modular programming
From MaRDI portal
Publication:3648358
DOI10.1017/S1471068409990159zbMath1184.68163OpenAlexW2154392574MaRDI QIDQ3648358
Miroslaw Truszczynski, Stefan Woltran
Publication date: 25 November 2009
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068409990159
complexityminimal modelsanswer-set programmingstable modelssupported modelsuniform equivalencestrong equivalencerelativized equivalence
Related Items (4)
Model-based recasting in answer-set programming ⋮ Incremental maintenance of overgrounded logic programs with tailored simplifications ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ A general notion of equivalence for abstract argumentation
Cites Work
- Hyperequivalence of logic programs with respect to supported models
- Logic programming and knowledge representation---The A-Prolog perspective
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programs with stable model semantics as a constraint programming paradigm
- Some (in)translatability results for normal logic programs and propositional theories
- Negation as failure in the head
- Characterizations of the disjunctive stable semantics by partial evaluation
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Characterization of strongly equivalent logic programs in intermediate logics
- Strong equivalence made easy: nested expressions and weight constraints
- Semantical characterizations and complexity of equivalences in answer set programming
- Modularity Aspects of Disjunctive Stable Models
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Strongly equivalent logic programs
This page was built for publication: Relativized hyperequivalence of logic programs for modular programming
