Enhancing disjunctive logic programming systems by SAT checkers
type: Item
instance of: scholarly article
title: Enhancing disjunctive logic programming systems by SAT checkers
zbMATH Open document ID: 1082.68525
DOI: 10.1016/S0004-3702(03)00078-X
author: Christoph Koch
author: N. Leone
author: Gerald Pfeifer
published in: Artificial Intelligence
publication date: 2006-02-07T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 5003924
zbMATH Keywords: Disjunctive logic programming
zbMATH Keywords: Nonmonotonic reasoning
zbMATH Keywords: Head-cycle-free programs
zbMATH Keywords: Answer set programs
zbMATH Keywords: Stable model checking
describes a project that uses: Smodels
describes a project that uses: Datalog
describes a project that uses: ASSAT
describes a project that uses: NoMoRe
MaRDI profile type: Publication
cites work: Q3983043
cites work: Q3983045
cites work: Logic programming and knowledge representation
cites work: Knowledge Representation, Reasoning and Declarative Problem Solving
cites work: Complexity Results for Nonmonotonic Logics
cites work: The complexity of logic-based abduction
cites work: On the complexity of propositional knowledge base revision, updates, and counterfactuals
cites work: Q4708911
cites work: Computational complexity of planning and approximate planning in the presence of incompleteness
cites work: Declarative problem-solving using the DLV system
cites work: Q4798010
cites work: Q4391449
cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
cites work: Q3939270
cites work: Static semantics for normal and disjunctive logic programs
cites work: Logic programming and negation: A survey
cites work: Q4225120
cites work: Negation by default and unstratifiable logic programs
cites work: Propositional semantics for disjunctive logic programs
cites work: Reasoning with minimal models: efficient algorithms and applications
cites work: A Computing Procedure for Quantification Theory
cites work: Q3221403
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: Bottom-up computation of perfect models for disjunctive theories
cites work: Q4798024
cites work: Efficient evaluation of a class of ordered logic programs
description: scientific article; zbMATH DE number 5003924