Pages that link to "Item:Q1199919"
From MaRDI portal
The following pages link to On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919):
Displayed 29 items.
- Knowledgebase transformations (Q676426) (← links)
- Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases (Q814499) (← links)
- A consistency-based approach for belief change (Q814523) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Weakening conflicting information for iterated revision and knowledge integration (Q814566) (← links)
- \(\text{DA}^2\) merging operators (Q814605) (← links)
- Cumulative default logic: Finite characterization, algorithms, and complexity (Q1337685) (← links)
- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem (Q1367267) (← links)
- Sound and efficient closed-world reasoning for planning (Q1399125) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- Fast algorithms for revision of some special propositional knowledge bases (Q1415946) (← links)
- The complexity of belief update (Q1575185) (← links)
- Operational and complete approaches to belief revision (Q1579730) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- The complexity of theory revision (Q1606294) (← links)
- Minimal-change integrity maintenance using tuple deletions (Q1776402) (← links)
- Classical and weighted knowledgebase transformations (Q1816654) (← links)
- A logical framework for knowledge base maintenance (Q1894319) (← links)
- Propositional truth maintenance systems: Classification and complexity analysis (Q1924776) (← links)
- Propositional semantics for disjunctive logic programs (Q1924819) (← links)
- The sequence modeling method based on ECC in developing program specifications (Q1964365) (← links)
- The size of a revised knowledge base (Q1978467) (← links)
- Propositional belief base update and minimal change (Q1978472) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability (Q3523066) (← links)
- A practical parallel algorithm for propositional knowledge base revision (Q4229567) (← links)
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision (Q4443390) (← links)
- Belief revision and update: Complexity of model checking (Q5943121) (← links)