Logic Programming and Nonmonotonic Reasoning

DOI10.1007/B94792MaRDI QIDQ5424868zbMATH OpenOpenAlexFDO

Authors Thomas Eiter, Axel Polleres

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

Mathematics Subject Classification ID

Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
• Enhancing disjunctive logic programming systems by SAT checkers
• Logic Programming and Nonmonotonic Reasoning
• The power of non-ground rules in Answer Set Programming
• Propositional semantics for disjunctive logic programs

Cited in

(3)

• Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
• Logic Programming
• Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Logic Programming and Nonmonotonic Reasoning

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