The complexity of propositional closed world reasoning and circumscription
type: Item
instance of: scholarly article
title: The complexity of propositional closed world reasoning and circumscription
zbMATH Open document ID: 0806.68096
DOI: 10.1016/S0022-0000(05)80004-2
author: Marco Cadoli
author: Maurizio Lenzerini
published in: Journal of Computer and System Sciences
publication date: 1995-02-13T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 598091
zbMATH Keywords: computational complexity
zbMATH Keywords: nonmonotonic inheritance
zbMATH Keywords: diagnosis
zbMATH Keywords: default reasoning
MaRDI profile type: Publication
Wikidata QID: Q55980557
cites work: Q4428289
cites work: Q3750100
cites work: The computational complexity of abduction
cites work: The complexity of model checking for circumscriptive formulae
cites work: An efficient method for eliminating varying predicates from a circumscription
cites work: A survey of complexity results for non-monotonic logics
cites work: Eliminating the fixed predicates from a circumscription
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4198056
cites work: Negation as failure: careful closure procedure
cites work: An algorithm to compute circumscription
cites work: A circumscriptive theorem prover
cites work: Q4385525
cites work: Hard problems for simple default logics
cites work: Some computational aspects of circumscription
cites work: Why not negation by fixpoint?
cites work: Closed-world databases and circumscription
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3939270
cites work: Minimal consequence in sentential logic
cites work: Weak generalized closed world assumption
cites work: A logic for default reasoning
cites work: A theory of diagnosis from first principles
cites work: The complexity of satisfiability problems
cites work: Q3200595
cites work: The decision problem for database dependencies
cites work: Querying logical databases
cites work: Deduction in non-Horn databases
DBLP publication ID: journals/jcss/CadoliL94
description: scientific article; zbMATH DE number 598091