Logic Programming and Nonmonotonic Reasoning
From MaRDI portal
Publication:5424867
DOI10.1007/b94792zbMath1122.68369OpenAlexW4214677882MaRDI QIDQ5424867
Hans Tompits, Michael Fink, Stefan Woltran, Thomas Eiter
Publication date: 7 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94792
Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Related Items (23)
Backdoors to Normality for Disjunctive Logic Programs ⋮ Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ Strong order equivalence ⋮ Equilibrium logic ⋮ Unnamed Item ⋮ Model-based recasting in answer-set programming ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Synonymous theories and knowledge representations in answer set programming ⋮ On the limits of forgetting in answer set programming ⋮ Unnamed Item ⋮ Rule Calculus: Semantics, Axioms and Applications ⋮ Partial equilibrium logic ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics ⋮ General default logic ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Abstraction for non-ground answer set programs ⋮ Answer Set Programming: A Primer ⋮ Engineering an Incremental ASP Solver ⋮ Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence ⋮ Removing Redundancy from Answer Set Programs ⋮ Backdoors to tractable answer set programming
Uses Software
This page was built for publication: Logic Programming and Nonmonotonic Reasoning
