Relational queries computable in polynomial time
Information and Control
Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
On restrictions of ordered paramodulation with simplification
CADE-10 Proceedings of the tenth international conference on Automated deduction
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Simple LPO constraint solving methods
Information Processing Letters
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Saturation of First-Order (Constrained) Clauses with the Saturate System
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Constraints and theorem proving
Constraints in computational logics
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
Journal of Automated Reasoning
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
On the Completeness of Arbitrary Selection Strategies for Paramodulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Complexity Analysis of Static Analyses
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Paramodulation with Built-In Abelian Groups
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Superposition with completely built-in Abelian groups
Journal of Symbolic Computation
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
User-definable resource bounds analysis for logic programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Hi-index | 0.00 |
We define order locality to be a property of clauses relative to a term ordering. This property is a kind of generalization of the subformula property for proofs where terms arising in proofs are bounded, under the given ordering, by terms appearing in the goal clause. We show that when a clause set is order local, then the complexity of its ground entailment problem is a function of its structure (e.g., full versus Horn clauses), and the ordering used. We prove that, in many cases, order locality is equivalent to a clause set being saturated under ordered resolution. This provides a means of using standard resolution theorem provers for testing order locality and transforming non-local clause sets into local ones. We have used the Saturate system to automatically establish complexity bounds for a number of nontrivial entailment problems relative to complexity classes which include polynomial and exponential time and co-NP.