Enhancing disjunctive logic programming systems by SAT checkers

DOI10.1016/S0004-3702(03)00078-XzbMath1082.68525MaRDI QIDQ814529

Gerald Pfeifer, Christoph Koch, Nicola Leone

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Nonmonotonic reasoningDisjunctive logic programmingAnswer set programsHead-cycle-free programsStable model checking

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (7)

On elementary loops of logic programs ⋮ Exploiting Unfounded Sets for HEX-Program Evaluation ⋮ Vicious Circle Principle and Logic Programs with Aggregates ⋮ Disjunctive answer set solvers via templates ⋮ An incremental algorithm for generating all minimal models ⋮ New models for generating hard random Boolean formulas and disjunctive logic programs ⋮ Graph-based construction of minimal models

Uses Software

• ASSAT
• Smodels
• NoMoRe
• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Negation by default and unstratifiable logic programs
• Reasoning with minimal models: efficient algorithms and applications
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Static semantics for normal and disjunctive logic programs
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Bottom-up computation of perfect models for disjunctive theories
• Complexity Results for Nonmonotonic Logics
• Logic programming and negation: A survey
• Logic programming and knowledge representation
• The complexity of logic-based abduction
• Efficient evaluation of a class of ordered logic programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• A Computing Procedure for Quantification Theory

This page was built for publication: Enhancing disjunctive logic programming systems by SAT checkers