Logic Programming
From MaRDI portal
Publication:5191482
DOI10.1007/b94619zbMath1204.68052OpenAlexW2889864133MaRDI QIDQ5191482
Publication date: 6 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94619
computational complexityprogram optimizationstable modelsanswer set semanticsuniform equivalencestrong equivalence
Related Items (29)
An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Performance Tuning in Answer Set Programming ⋮ Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ LARS: a logic-based framework for analytic reasoning over streams ⋮ Strong order equivalence ⋮ Equilibrium logic ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ Semantic forgetting in answer set programming ⋮ Normal and strong expansion equivalence for argumentation frameworks ⋮ Unnamed Item ⋮ Equivalence of defeasible normative systems ⋮ Model-based recasting in answer-set programming ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ Dual-normal logic programs – the forgotten class ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Inductive equivalence in clausal logic and nonmonotonic logic programming ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey ⋮ Reasoning on anonymity in Datalog ⋮ Skepticism relations for comparing argumentation semantics ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets ⋮ Inlining External Sources in Answer Set Programs ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Abstraction for non-ground answer set programs ⋮ Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming ⋮ Program Correspondence under the Answer-Set Semantics: The Non-ground Case
Uses Software
This page was built for publication: Logic Programming
