Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Artificial Intelligence
Reasoning about action I: a possible worlds approach
Artificial Intelligence
Intelligent user interfaces
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A computational approach for belief change
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
| Hi-index | 0.00 |
In this paper, the computational complexity of propositional clause set counter-factuals is discussed. It is shown that the computational complexity of propositional clause set counterfactuals is at the second level of the polynomial hierarchy, and that the computational complexity of propositional Horn clause set counterfactuals is at the first level of the polynomial hierarchy. Furthermore, some polynomial algorithms are presented for some special propositional clause set, such as the unique satisfiable clause set and the clause set of which only one subset is minimally inconsistent with the input clause whose inconsistency check can be solved in polynomial time.