Tight logic programs

DOI10.1017/S1471068403001765MaRDI QIDQ4815031zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

CompletionAnswer setsTightnessFages' theorem.Supportedness

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Negation as failure using tight derivations for general logic programs
• scientific article; zbMATH DE number 4199654
• Tight, consistent, and computable completions for unrestricted logic programs
• Graph properties for normal logic programs
• Tight semantics for logic programs

Cited in

(40)

• A characterization of answer sets for logic programs
• Statistical relational extension of answer set programming
• Tight semantics for logic programs
• Model-based recasting in answer-set programming
• Lloyd-Topor completion and general stable models
• Answer set programming modulo acyclicity
• Logic programs with abstract constraint atoms: the role of computations
• A survey of known results and research areas for \(n\)-queens
• Some (in)translatability results for normal logic programs and propositional theories
• Towards Verifying Logic Programs in the Input Language of clingo
• On elementary loops of logic programs
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• scientific article; zbMATH DE number 2085281 (Why is no real title available?)
• Verifying Tight Logic Programs with anthem and vampire
• A generalization of the Lin-Zhao theorem
• Stable models and circumscription
• Hybrid planning for challenging construction problems: an answer set programming approach
• ASP and subset minimality: enumeration, cautious reasoning and MUSes
• Paracoherent answer set computation
• Stable models and difference logic
• On the relation among answer set solvers
• A General Framework for Stable Roommates Problems using Answer Set Programming
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
• Super logic programs
• Design and results of the Fifth Answer Set Programming Competition
• Loop formulas for circumscription
• Steadfast logic programs
• Escape from Zurg: an exercise in logic programming
• Inferring phylogenetic trees using answer set programming
• Computationally hard problems for logic programs under answer set semantics
• Qualitative reasoning about 2D cardinal directions using answer set programming
• Negation as failure using tight derivations for general logic programs
• Solving stable matching problems using answer set programming
• Backdoors to tractable answer set programming
• Program completion in the input language of GRINGO
• Semantic forgetting 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
• Optimal planning with expressive action languages as constraint optimization
• Past-present temporal programs over finite traces

This page was built for publication: Tight logic programs

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