Relativized hyperequivalence of logic programs for modular programming

DOI10.1017/S1471068409990159MaRDI QIDQ3648358zbMATH OpenOpenAlexFDO

Authors Mirosław Truszczyński, 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

zbMATH Keywords

complexityanswer-set programmingminimal modelsstable modelssupported modelsuniform equivalencestrong equivalencerelativized equivalence

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Relativized Hyperequivalence of Logic Programs for Modular Programming
• A semantics for modular general logic programs
• Hyperequivalence of logic programs with respect to supported models
• Modularization of logic programs
• Modular nonmonotonic logic programming revisited
• scientific article; zbMATH DE number 1638651
• scientific article; zbMATH DE number 4181309
• Logical Relations as Types: Proof-Relevant Parametricity for Program Modules
• Modular Algorithms for Heterogeneous Modal Logics
• scientific article; zbMATH DE number 3956409

Cites work

• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Characterization of strongly equivalent logic programs in intermediate logics
• Characterizations of the disjunctive stable semantics by partial evaluation
• Hyperequivalence of logic programs with respect to supported models
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic programming and knowledge representation---The A-Prolog perspective
• Logic programs with stable model semantics as a constraint programming paradigm
• Modularity Aspects of Disjunctive Stable Models
• Negation as failure in the head
• On the computational cost of disjunctive logic programming: Propositional case
• Semantical characterizations and complexity of equivalences in answer set programming
• Some (in)translatability results for normal logic programs and propositional theories
• Strong equivalence made easy: nested expressions and weight constraints
• Strongly equivalent logic programs

Cited in

(6)

• Model-based recasting in answer-set programming
• A general notion of equivalence for abstract argumentation
• Incremental maintenance of overgrounded logic programs with tailored simplifications
• Relativized Hyperequivalence of Logic Programs for Modular Programming
• Equivalence between answer-set programs under (partially) fixed input
• Hyperequivalence of logic programs with respect to supported models

This page was built for publication: Relativized hyperequivalence of logic programs for modular programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648358)