Relativized Hyperequivalence of Logic Programs for Modular Programming

DOI10.1007/978-3-540-89982-2_48MaRDI QIDQ5504681zbMATH OpenOpenAlexFDO

Authors Mirosław Truszczyński, Stefan Woltran

Publication date 22 January 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.3512

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Relativized hyperequivalence of logic programs for modular programming
• Hyperequivalence of logic programs with respect to supported models
• Logics in Artificial Intelligence
• scientific article; zbMATH DE number 3956409
• Logic Programming

Cites work

• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
• Characterization of strongly equivalent logic programs in intermediate logics
• scientific article; zbMATH DE number 1142320 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 1926645 (Why is no real title available?)
• scientific article; zbMATH DE number 5212421 (Why is no real title available?)
• Hyperequivalence of logic programs with respect to supported models
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming
• Logic programming and knowledge representation---The A-Prolog perspective
• Logic programs with stable model semantics as a constraint programming paradigm
• Logics in Artificial Intelligence
• Modularity Aspects of Disjunctive Stable Models
• 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

(3)

• Hyperequivalence of logic programs with respect to supported models
• Relativized hyperequivalence of logic programs for modular programming
• Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence

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 Q5504681)