Model-based recasting in answer-set programming

DOI10.1080/11663081.2013.799318zbMATH Open1400.68048OpenAlexW1989634318MaRDI QIDQ4583308FDOQ4583308

Authors: Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits, Stefan Woltran 

Publication date: 28 August 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2013.799318

Recommendations

• Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• scientific article; zbMATH DE number 2090116
• Strongly equivalent logic programs
• Equivalence between answer-set programs under (partially) fixed input

zbMATH Keywords

answer-set programminglogic of here-and-thereuniform equivalencestrong equivalence

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Cites Work

• Propositional semantics for disjunctive logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic Programming and Nonmonotonic Reasoning
• Strongly equivalent logic programs
• Equilibrium logic
• The decision problem for some classes of sentences without quantifiers
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• A logic for default reasoning
• Title not available (Why is that?)
• Logic Programming
• Semantical characterizations and complexity of equivalences in answer set programming
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• A Characterization of Strong Equivalence for Logic Programs with Variables
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Title not available (Why is that?)
• A logical semantics for description logic programs
• Title not available (Why is that?)
• Tight logic programs
• Hyperequivalence of logic programs with respect to supported models
• Propositional theories are strongly equivalent to logic programs
• Stable inference as intuitionistic validity
• Logics in Artificial Intelligence
• Logic Programming
• Relativized hyperequivalence of logic programs for modular programming
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
• Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
• A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• Static analysis in Datalog extensions
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case

Cited In (12)

• Relating two dialects of answer set programming
• Title not available (Why is that?)
• Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• Realizability of three-valued semantics for abstract dialectical frameworks
• Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
• A denotational semantics for equilibrium logic
• Title not available (Why is that?)
• Static and dynamic orderings on Dungean argumentation frameworks -- an overview
• On uniform equivalence of epistemic logic programs
• Termination of grounding is not preserved by strongly equivalent transformations
• Equivalence between answer-set programs under (partially) fixed input
• Dual-normal logic programs -- the forgotten class

This page was built for publication: Model-based recasting in answer-set programming

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