Enhancing disjunctive logic programming systems by SAT checkers

DOI10.1016/S0004-3702(03)00078-XzbMATH Open1082.68525MaRDI QIDQ814529FDOQ814529

Authors: Christoph Koch, N. Leone, Gerald Pfeifer 

Publication date: 7 February 2006

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

Recommendations

• scientific article; zbMATH DE number 1114054
• Propositional semantics for disjunctive logic programs
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• The DLV system for knowledge representation and reasoning

zbMATH Keywords

Answer set programsDisjunctive logic programmingHead-cycle-free programsNonmonotonic reasoningStable model checking

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• Title not available (Why is that?)
• Disjunctive answer set solvers via templates
• A backjumping technique for disjunctive logic programming
• On elementary loops of logic programs
• An incremental algorithm for generating all minimal models
• Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
• New models for generating hard random Boolean formulas and disjunctive logic programs
• Vicious circle principle and logic programs with aggregates
• Exploiting unfounded sets for HEX-program evaluation
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Graph-based construction of minimal models

Uses Software

• ASSAT
• Smodels
• NoMoRe
• Datalog

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

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