Making believers out of computers
Artificial Intelligence
A theory of diagnosis from first principles
Artificial Intelligence
On the relationship between circumscription and negation as failure
Artificial Intelligence
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
The complexity of model checking for circumscriptive formulae
Information Processing Letters
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Complexity and expressive power of disjunctive logic programming (research overview)
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Computing circumscriptive databases, I: theory and algorithms
Information and Computation
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Off-line reasoning for on-line efficiency: knowledge bases
Artificial Intelligence
Default reasoning using classical logic
Artificial Intelligence
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
Reducing belief revision to circumscription (and vice versa)
Artificial Intelligence
On compact representations of propositional circumscription
Theoretical Computer Science
The size of a revised knowledge base
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A survey on knowledge compilation
AI Communications
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Parameterized Complexity
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
The size of MDP factored policies
Eighteenth national conference on Artificial intelligence
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Where fail-safe default logics fail
ACM Transactions on Computational Logic (TOCL)
Invitation to data reduction and problem kernelization
ACM SIGACT News
What makes propositional abduction tractable
Artificial Intelligence
Semantic forgetting in answer set programming
Artificial Intelligence
Model Checking and Preprocessing
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Incremental algorithms for approximate compilation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
On polynomial sized MDP succinct policies
Journal of Artificial Intelligence Research
A theory of average-case compilability in knowledge representation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling the votes of a subelectorate
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Knowledge compilation with empowerment
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
Some computationally hard problems, e.g., deduction in logical knowledge bases- are such that part of an instance is known well before the rest of it, and remains the same for several subsequent instances of the problem. In these cases, it is useful to preprocess off-line this known part so as to simplify the remaining on-line problem. In this paper we investigate such a technique in the context of intractable, i.e., NP-hard, problems. Recent results in the literature show that not all NP-hard problems behave in the same way: for some of them preprocessing yields polynomial-time on-line simplified problems (we call them compilable), while for other ones their compilability implies some consequences that are considered unlikely. Our primary goal is to provide a sound methodology that can be used to either prove or disprove that a problem is compilable. To this end, we define new models of computation, complexity classes, and reductions. We find complete problems for such classes, "completeness" meaning they are "the less likely to be compilable." We also investigate preprocessing that does not yield polynomial-time on-line algorithms, but generically "decreases" complexity. This leads us to define "hierarchies of compilability," that are the analog of the polynomial hierarchy. A detailed comparison of our framework to the idea of "parameterized tractability" shows the differences between the two approaches.