Foundations of Information and Knowledge Systems

DOI10.1007/11663881MaRDI QIDQ5898544zbMATH OpenOpenAlexFDO

Authors Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir

Publication date 12 February 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11663881

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)

Recommendations

• Open answer set programming with guarded programs
• Logic Programming and Nonmonotonic Reasoning
• Guarded resolution for answer set programming
• Guards, bounds, and generalized semantics
• Chain answer sets for logic programs with generalized atoms

Cited in

(4)

• Open answer set programming with guarded programs
• Reasoning with forest logic programs using fully enriched automata
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Foundations of Information and Knowledge Systems

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