Ontic: a knowledge representation system for mathematics
Ontic: a knowledge representation system for mathematics
Taxonomic syntax for first order inference
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
An algorithm for reasoning about equality
Communications of the ACM
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Taxonomic syntax for first order inference
Journal of the ACM (JACM)
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient deductive methods for program analysis
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automated complexity analysis based on ordered resolution
Journal of the ACM (JACM)
Constraints and theorem proving
Constraints in computational logics
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
Elimination of Self-Resolving Clauses
Journal of Automated Reasoning
Algorithms and reductions for rewriting problems. II
Information Processing Letters
Complexity of Linear Standard Theories
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On the Complexity Analysis of Static Analyses
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Complexity Analysis Based on Ordered Resolution
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Security properties: two agents are sufficient
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
A decision procedure for the verification of security protocols with explicit destructors
Proceedings of the 11th ACM conference on Computer and communications security
Easy intruder deduction problems with homomorphisms
Information Processing Letters
Modular proof systems for partial functions with Evans equality
Information and Computation - Special issue: Combining logical systems
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical combination of intruder theories
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and 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
Challenges in the Automated Verification of Security Protocols
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Easy intruder deduction problems with homomorphisms
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Security properties: two agents are sufficient
ESOP'03 Proceedings of the 12th European conference on Programming
A new knowledge representation strategy for cryptographic protocol analysis
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Normal proofs in intruder theories
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
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
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Automatic decidability and combinability
Information and Computation
Decidability of unification in EL without top constructor
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Hierarchic reasoning in local theory extensions
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Intruder deduction for AC-like equational theories with homomorphisms
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
On hierarchical reasoning in combinations of theories
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Orchestration under security constraints
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Towards the orchestration of secured services under non-disclosure policies
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
Tractable inference systems: an extension with a deducibility predicate
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Hi-index | 0.01 |
A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical verification of a theorem originally proved independently by Kozen and Shostak. The procedure is algorithmic, rather than heuristic, and the class of automatically recognizable tractable rule sets can be precisely characterized. A series of examples of rule sets whose tractability is nontrivial, yet machine recognizable, is also given. The technical framework developed here is viewed as a first step toward a general theory of tractable inference relations.