Tight logic programs
From MaRDI portal
Publication:4815031
DOI10.1017/S1471068403001765zbMath1079.68014OpenAlexW2158059231MaRDI QIDQ4815031
Esra Erdem, Vladimir Lifschitz
Publication date: 19 August 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068403001765
Knowledge representation (68T30) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Related Items
On elementary loops of logic programs, Towards Verifying Logic Programs in the Input Language of clingo, Answer Set Programming Modulo Acyclicity, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, A generalization of the Lin-Zhao theorem, Semantic forgetting in answer set programming, A characterization of answer sets for logic programs, Model-based recasting in answer-set programming, Modeling the suppression task under weak completion and well-founded semantics, Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming, Program completion in the input language of GRINGO, Solving stable matching problems using answer set programming, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Statistical relational extension of answer set programming, Design and results of the Fifth Answer Set Programming Competition, Hybrid planning for challenging construction problems: an answer set programming approach, Verifying Tight Logic Programs with anthem and vampire, A General Framework for Stable Roommates Problems using Answer Set Programming, Loop formulas for circumscription, Lloyd-Topor completion and general stable models, Paracoherent answer set computation, Inferring phylogenetic trees using answer set programming, Logic programs with abstract constraint atoms: the role of computations, Stable models and circumscription, Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, A survey of known results and research areas for \(n\)-queens, On the relation among answer set solvers, Stable models and difference logic, Some (in)translatability results for normal logic programs and propositional theories, Backdoors to tractable answer set programming
