On the complexity of propositional knowledge base revision, updates, and counterfactuals
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4166927 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 44621 (Why is no real title available?)
- scientific article; zbMATH DE number 140392 (Why is no real title available?)
- scientific article; zbMATH DE number 140403 (Why is no real title available?)
- scientific article; zbMATH DE number 140406 (Why is no real title available?)
- scientific article; zbMATH DE number 176519 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 3266584 (Why is no real title available?)
- scientific article; zbMATH DE number 4185089 (Why is no real title available?)
- scientific article; zbMATH DE number 4187148 (Why is no real title available?)
- A circumscriptive theorem prover
- A logic for default reasoning
- An algorithm to compute circumscription
- Bounded Query Classes
- Circumscription - a form of non-monotonic reasoning
- Circumscriptive semantics for updating knowledge bases
- Closed-world databases and circumscription
- Complexity Results for Nonmonotonic Logics
- Counterfactuals
- Deduction in non-Horn databases
- Knowledge in flux. Modeling the dynamics of epistemic states
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Modal logic for default reasoning
- Negation as failure: careful closure procedure
- New developments in structural complexity theory
- Non-monotonic logic. I
- Nonmonotonic Logic II
- On the logic of theory change: Partial meet contraction and revision functions
- On the relationship between circumscription and negation as failure
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Propositional knowledge base revision and minimal change
- Reasoning about action. I: A possible worlds approach
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Semantical considerations on nonmonotonic logic
- The complexity of facets (and some facets of complexity)
- The complexity of optimization problems
- Updates and subjunctive queries
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP
Cited in
(78)- Compilability and compact representations of revision of Horn knowledge bases
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Belief revision and update: Complexity of model checking
- Reducing belief revision to circumscription (and vice versa)
- On the measure of conflicts: Shapley inconsistency values
- Sound and efficient closed-world reasoning for planning
- A syntax-based approach to measuring the degree of inconsistency for belief bases
- The size of a revised knowledge base
- The complexity of theory revision
- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
- Knowledge updates: Semantics and complexity issues
- First-order logical filtering
- On homeostatic behavior of dynamic deductive data bases
- Propositional truth maintenance systems: Classification and complexity analysis
- Fast algorithms for revision of some special propositional knowledge bases
- Classical and weighted knowledgebase transformations
- Distance-Based Semantics for C-Structure Belief Revision
- A logical framework for knowledge base maintenance
- The complexity of belief update
- A consistency-based approach for belief change
- Belief revision in Horn theories
- Instance-level update in DL-Lite ontologies through first-order rewriting
- Cumulative default logic: Finite characterization, algorithms, and complexity
- A framework for handling logical inconsistencies in the fusion of Boolean knowledge bases
- Weakening conflicting information for iterated revision and knowledge integration
- Propositional semantics for disjunctive logic programs
- Main issues in belief revision, belief merging and information fusion
- Using counterfactuals in knowledge-based programming
- Updating action domain descriptions
- Fixpoint semantics for active integrity constraints
- Minimal-change integrity maintenance using tuple deletions
- Efficient combination of decision procedures for MUS computation
- Does This Set of Clauses Overlap with at Least One MUS?
- A practical parallel algorithm for propositional knowledge base revision
- A theory of change for prioritised resilient and evolvable software systems
- Implementing semantic merging operators using binary decision diagrams
- AGM 25 years. Twenty-five years of research in belief change
- On the complexity of inconsistency measurement
- Active integrity constraints for general-purpose knowledge bases
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- Reasoning under inconsistency: a forgetting-based approach
- Using local search to find MSSes and MUSes
- On getting rid of the preprocessing minimization step in MUC-finding algorithms
- Propositional belief base update and minimal change
- Limited-knowledge propositional announcement synthesis under Dalal revision: tight PH bounds, parameterized tractability and kernelization
- scientific article; zbMATH DE number 820416 (Why is no real title available?)
- Mixed Iterated Revisions: Rationale, Algorithms, and Complexity
- \(\text{DA}^2\) merging operators
- GenB: A General Solver for AGM Revision
- Considerations on belief revision in an action theory
- scientific article; zbMATH DE number 6970794 (Why is no real title available?)
- Semantics and complexity of abduction from default theories
- A Default Logic Patch for Default Logic
- Foundations of instance level updates in expressive description logics
- DL-Lite ontology revision based on an alternative semantic characterization
- Belief merging by examples
- Revision operators with compact representations
- The complexity class θp2: Recent results and applications in AI and modal logic
- The sequence modeling method based on ECC in developing program specifications
- Common equivalence and size of forgetting from Horn formulae
- Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases
- A general framework for computing maximal contractions
- An extension-based approach to belief revision in abstract argumentation
- scientific article; zbMATH DE number 140392 (Why is no real title available?)
- Approaches to measuring inconsistency for stratified knowledge bases
- Operational and complete approaches to belief revision
- Grounded fixpoints and active integrity constraints
- Dealing Automatically with Exceptions by Introducing Specificity in ASP
- Local-search extraction of mUSes
- Belief update within propositional fragments
- Enhancing disjunctive logic programming systems by SAT checkers
- Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases
- Belief revision within fragments of propositional logic
- Capturing model-based ontology evolution at the instance level: the case of DL-Lite
- scientific article; zbMATH DE number 4094868 (Why is no real title available?)
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
- Knowledgebase transformations
This page was built for publication: On the complexity of propositional knowledge base revision, updates, and counterfactuals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199919)
