Abstract canonical inference

Authors:
Maria Paola Bonacina;Nachum Dershowitz
Affiliations:
Università degli Studi di Verona, Italy;Tel Aviv University, Ramat Aviv, Israel
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2007

Citing 26
Cited 17

Completion of a set of rules modulo a set of equations

SIAM Journal on Computing
Proof by consistency

Artificial Intelligence
Critical pair criteria for completion

Journal of Symbolic Computation
Existence, uniqueness, and construction of rewrite systems

SIAM Journal on Computing
A strong restriction of the inductive completion procedure

Journal of Symbolic Computation
Completion for rewriting modulo a congruence

Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Completion for unification

Theoretical Computer Science
Theorem-proving with resolution and superposition

Journal of Symbolic Computation
On word problems in horn theories

Journal of Symbolic Computation
Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method

Journal of the ACM (JACM)
An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Journal of the ACM (JACM)
On rewrite programs: semantics and relationship with Prolog

Journal of Logic Programming
Deductive and inductive synthesis of equational programs

Journal of Symbolic Computation - Special issue on automatic programming
Distributed automated deduction

Distributed automated deduction
Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)
Towards a foundation of completion procedures as semidecision procedures

Theoretical Computer Science
Proof lengths for equational completion

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
Gandalf

Journal of Automated Reasoning
On Word Problems in Equational Theories

ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
Cononical Sets of Horn Clauses

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Abstract Congruence Closure

Journal of Automated Reasoning
Abstract canonical presentations

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
The design and implementation of VAMPIRE

AI Communications - CASC
E - a brainiac theorem prover

AI Communications - CASC
A taxonomy of theorem-proving strategies

Artificial intelligence today

Abstract canonical presentations

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Structures for Abstract Rewriting

Journal of Automated Reasoning
Cut Elimination in Deduction Modulo by Abstract Completion

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Canonicity!

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Canonical Inference for Implicational Systems

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
New results on rewrite-based satisfiability procedures

ACM Transactions on Computational Logic (TOCL)
On Deciding Satisfiability by DPLL($\Gamma+{\mathcal T}$) and Unsound Theorem Proving

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Towards a unified model of search in theorem-proving: subgoal-reduction strategies

Journal of Symbolic Computation
Abstract critical pairs and confluence of arbitrary binary relations

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On interpolation in decision procedures

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning
Boolean rings for intersection-based satisfiability

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Open. closed. open.

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Unbounded proof-length speed-up in deduction modulo

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
From diagrammatic confluence to modularity

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and rewrite-system reduction are connected to proof orderings. Fairness of deductive mechanisms is defined in terms of proof orderings, distinguishing between (ordinary) “fairness,” which yields completeness, and “uniform fairness,” which yields saturation.