Relational queries computable in polynomial time
Information and Control
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Ontic: a knowledge representation system for mathematics
Ontic: a knowledge representation system for mathematics
Query evaluation in recursive databases: bottom-up and top-down reconciled
Data & Knowledge Engineering
Algebraic reconstruction of types and effects
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
An algorithm for reasoning about equality
Communications of the ACM
Automated complexity analysis based on ordered resolution
Journal of the ACM (JACM)
Complexity Analysis Based on Ordered Resolution
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Lifting Transformations
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
Incremental Instance Generation in Local Reasoning
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Locality Results for Certain Extensions of Theories with Bridging Functions
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Polynomial constraints for sets with cardinality bounds
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On local reasoning in verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Automatic decidability and combinability
Information and Computation
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
Identifying polynomial-time recursive functions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
On hierarchical reasoning in combinations of theories
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Instantiation Schemes for Nested Theories
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives polynomial-time evaluation strategies for a large variety of rule sets that cannot be given terminating evaluation strategies by any other known automatic technique. This article discusses three new results. First, it is shown that every polynomial-time predicate can be defined by an (unstratified) local rule set. Second, a new machine-recognizable subclass of the local rule sets is identified. Finally, we show that locality, as a property of rule sets, is undecidable in general.