On the complexity of propositional knowledge base revision, updates, and counterfactuals
type: Item
instance of: scholarly article
title: On the complexity of propositional knowledge base revision, updates, and counterfactuals
zbMATH Open document ID: 0763.68038
DOI: 10.1016/0004-3702(92)90018-S
author: Thomas Eiter
author: Georg Gottlob
published in: Artificial Intelligence
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68T35
zbMATH DE Number: 96253
zbMATH Keywords: updating
zbMATH Keywords: revising propositional knowledge bases
zbMATH Keywords: minimal change
zbMATH Keywords: counterfactual
Wikidata QID: Q59259776
describes a project that uses: Ltur
MaRDI profile type: Publication
cites work: On the logic of theory change: Partial meet contraction and revision functions
cites work: Saturation, nonmonotonic reasoning and the closed-world assumption
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: Q5750466
cites work: Q3107917
cites work: Q4198056
cites work: Negation as failure: careful closure procedure
cites work: On the relationship between circumscription and negation as failure
cites work: Counterfactuals
cites work: A circumscriptive theorem prover
cites work: Reasoning about action. I: A possible worlds approach
cites work: Complexity Results for Nonmonotonic Logics
cites work: Q4028799
cites work: Updates and subjunctive queries
cites work: New developments in structural complexity theory
cites work: Q4385525
cites work: \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP
cites work: Q5751985
cites work: Q4028812
cites work: Propositional knowledge base revision and minimal change
cites work: The complexity of optimization problems
cites work: Closed-world databases and circumscription
cites work: Modal logic for default reasoning
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Nonmonotonic Logic II
cites work: Non-monotonic logic. I
cites work: Q3939270
cites work: LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
cites work: Semantical considerations on nonmonotonic logic
cites work: Q3493313
cites work: Q4028815
cites work: The complexity of facets (and some facets of complexity)
cites work: An algorithm to compute circumscription
cites work: A logic for default reasoning
cites work: Q5551124
cites work: Q4035685
cites work: Q4131648
cites work: Bounded Query Classes
cites work: Q3995235
cites work: Circumscriptive semantics for updating knowledge bases
cites work: Deduction in non-Horn databases
description: scientific article; zbMATH DE number 96253