On the computational cost of disjunctive logic programming: Propositional case
type: Item
instance of: scholarly article
title: On the computational cost of disjunctive logic programming: Propositional case
zbMATH Open document ID: 0858.68016
DOI: 10.1007/BF01536399
author: Thomas Eiter
author: Georg Gottlob
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-03-25T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 937277
zbMATH Keywords: disjunctive logic programming
Wikidata QID: Q59259761
MaRDI profile type: Publication
cites work: Generalized disjunctive well-founded semantics for logic programs.
cites work: Propositional semantics for disjunctive logic programs
cites work: General logical databases and programs: Default logic semantics and stratification
cites work: Negation by default and unstratifiable logic programs
cites work: Q4318639
cites work: The expressiveness of locally stratified programs
cites work: The complexity of model checking for circumscriptive formulae
cites work: The complexity of propositional closed world reasoning and circumscription
cites work: A survey of complexity results for non-monotonic logics
cites work: Horn clause queries and generalizations
cites work: Q3971264
cites work: Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
cites work: Q4022222
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: Q4198056
cites work: Q3983043
cites work: Negation as failure: careful closure procedure
cites work: On the relationship between circumscription and negation as failure
cites work: Complexity Results for Nonmonotonic Logics
cites work: Q4385525
cites work: Hard problems for simple default logics
cites work: Q4016556
cites work: A theory of nonmonotonic rule systems. II
cites work: How complicated is the set of stable models of a recursive logic program?
cites work: Autoepistemic logic
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3939270
cites work: Q3477931
cites work: Semantical considerations on nonmonotonic logic
cites work: Q3983045
cites work: Three-valued nonmonotonic formalisms and semantics of logic programs
cites work: Weak generalized closed world assumption
cites work: A logic for default reasoning
cites work: Inferring negative information from disjunctive databases
cites work: Q4131648
cites work: Q3348436
cites work: The well-founded semantics for general logic programs
cites work: Bounded Query Classes
cites work: Deduction in non-Horn databases
description: scientific article; zbMATH DE number 937277