The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Generalizations of Opt P to the polynomial hierarchy
Theoretical Computer Science
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
The complexity of logic-based abduction
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Belief revision and update: complexity of model checking
Journal of Computer and System Sciences
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
On Restricting the Access to an NP-Oracle
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A Complete Classification of the Complexity of Propositional Abduction
SIAM Journal on Computing
What makes propositional abduction tractable
Artificial Intelligence
Partial Polymorphisms and Constraint Satisfaction Problems
Complexity of Constraints
Frozen Boolean Partial Co-clones
ISMVL '09 Proceedings of the 2009 39th International Symposium on Multiple-Valued Logic
Information Processing Letters
Counting complexity of propositional abduction
Journal of Computer and System Sciences
Mathematical Logic for Computer Science
Mathematical Logic for Computer Science
Hi-index | 0.00 |
Many AI-related reasoning problems are based on the problem of satisfiability (SAT). While SAT itself becomes easy when restricting the structure of the formulas in a certain way, this is not guaranteed for more involved reasoning problems. In this work, we focus on reasoning tasks in the areas of belief revision and logic-based abduction and show that in some cases the restriction to Krom formulas (i.e., formulas in CNF where clauses have at most two literals) decreases the complexity, while in others it does not. We thus also consider additional restrictions to Krom formulas towards a better identification of the tractability frontier of such problems.