Leo Bachmair - RankMe

50 papers A* 6A 8B 2Misc 2Journal 11Unranked 19

Year	Rank	Type	Title / Venue / Authors
2005	Misc	`conf`	A Visual Interactive Framework for Formal Derivation. International Conference on Computational Science (1) Paul Agron, Leo Bachmair, Frank Nielsen
2004	Misc	`conf`	On the Combination of Congruence Closure and Completion. AISC Christelle Scharff, Leo Bachmair
2003	J	`jnl`	Abstract Congruence Closure. J. Autom. Reason. Leo Bachmair, Ashish Tiwari, Laurent Vigneron
2001	—	`ch.`	Resolution Theorem Proving. Handbook of Automated Reasoning Leo Bachmair, Harald Ganzinger
2000	A	`conf`	Abstract Congruence Closure and Specializations. CADE Leo Bachmair, Ashish Tiwari
2000	—	`conf`	Congruence Closure Modulo Associativity and Commutativity. FroCoS Leo Bachmair, I. V. Ramakrishnan, Ashish Tiwari, Laurent Vigneron
2000	—	`ed.`	Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings RTA Leo Bachmair
2000	A	`conf`	Rigid CADE Ashish Tiwari, Leo Bachmair, Harald Rueß
1999	—	`conf`	Normalization via Rewrite Closures. RTA Leo Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan, Ashish Tiwari
1998	—	`conf`	An LPO-based Termination Ordering for Higher-Order Terms without lambda-abstraction. TPHOLs Maxim Lifantsev, Leo Bachmair
1998	A	`conf`	Elimination of Equality via Transformation with Ordering Constraints. CADE Leo Bachmair, Harald Ganzinger, Andrei Voronkov
1998	J	`jnl`	Ordered Chaining Calculi for First-Order Theories of Transitive Relations. J. ACM Leo Bachmair, Harald Ganzinger
1998	A	`conf`	Strict Basic Superposition. CADE Leo Bachmair, Harald Ganzinger
1997	—	`conf`	D-Bases for Polynomial Ideals over Commutative Noetherian Rings. RTA Leo Bachmair, Ashish Tiwari
1997	—	`conf`	Paramodulation, Superposition, and Simplification. Kurt Gödel Colloquium Leo Bachmair
1996	—	`conf`	Subsumption Algorithms Based on Search Trees. CAAP Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan
1995	J	`jnl`	Basic Paramodulation Inf. Comput. Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
1995	A*	`conf`	Experiments with Associative-Commutative Discrimination Nets. IJCAI Leo Bachmair, Ta Chen, I. V. Ramakrishnan, Siva Anantharaman, Jacques Chabin
1994	—	`conf`	Associative-Commutative Superposition. CTRS Leo Bachmair, Harald Ganzinger
1994	—	`conf`	Buchberger's Algorithm: A Constraint-Based Completion Procedure. CCL Leo Bachmair, Harald Ganzinger
1994	—	`conf`	Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings. COMPASS/ADT Leo Bachmair, Harald Ganzinger, Jürgen Stuber
1994	J	`jnl`	Equational Inference, Canonical Proofs, and Proof Orderings. J. ACM Leo Bachmair, Nachum Dershowitz
1994	A	`conf`	Ordered Chaining for Total Orderings. CADE Leo Bachmair, Harald Ganzinger
1994	J	`jnl`	Refutational Theorem Proving for Hierarchic First-Order Theories. Appl. Algebra Eng. Commun. Comput. Leo Bachmair, Harald Ganzinger, Uwe Waldmann
1994	A*	`conf`	Rewrite Techniques for Transitive Relations LICS Leo Bachmair, Harald Ganzinger
1994	J	`jnl`	Rewrite-Based Equational Theorem Proving with Selection and Simplification. J. Log. Comput. Leo Bachmair, Harald Ganzinger
1993	—	`conf`	Associative-Commutative Discrimination Nets. TAPSOFT Leo Bachmair, Ta Chen, I. V. Ramakrishnan
1993	—	`conf`	Rewrite Techniques in Theorem Proving (Abstract). RTA Leo Bachmair
1993	A*	`conf`	Set Constraints are the Monadic Class LICS Leo Bachmair, Harald Ganzinger, Uwe Waldmann
1993	—	`conf`	Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality. Kurt Gödel Colloquium Leo Bachmair, Harald Ganzinger, Uwe Waldmann
1992	J	`jnl`	Associative-Commutative Reduction Orderings. Inf. Process. Lett. Leo Bachmair
1992	A	`conf`	Basic Paramodulation and Superposition. CADE Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
1992	B	`conf`	Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria. LPAR Leo Bachmair, Harald Ganzinger
1992	—	`conf`	Theorem Proving for Hierarchic First-Order Theories. ALP Leo Bachmair, Harald Ganzinger, Uwe Waldmann
1991	B	`conf`	Perfect Model Semantics for Logic Programs with Equality. ICLP Leo Bachmair, Harald Ganzinger
1990	—	`conf`	Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract). CTRS Leo Bachmair, Harald Ganzinger
1990	A	`conf`	On Restrictions of Ordered Paramodulation with Simplification. CADE Leo Bachmair, Harald Ganzinger
1989	J	`jnl`	Completion for Rewriting Modulo a Congruence. Theor. Comput. Sci. Leo Bachmair, Nachum Dershowitz
1989	—	`conf`	Proof Normalization for Resolution and Paramodulation. RTA Leo Bachmair
1988	J	`jnl`	Critical Pair Criteria for Completion. J. Symb. Comput. Leo Bachmair, Nachum Dershowitz
1988	A*	`conf`	Proof by Consistency in Equational Theories LICS Leo Bachmair
1987	—	`conf`	A critical pair criterion for completion modulo a congruence. EUROCAL Leo Bachmair, Nachum Dershowitz
1987	—	`conf`	Completion for Rewriting Modulo a Congruence. RTA Leo Bachmair, Nachum Dershowitz
1987	A*	`conf`	Inference Rules for Rewrite-Based First-Order Theorem Proving LICS Leo Bachmair, Nachum Dershowitz
1986	A	`conf`	Commutation, Transformation, and Termination. CADE Leo Bachmair, Nachum Dershowitz
1986	—	`conf`	Critical-pair criteria for the Knuth-Bendix completion procedure. SYMSAC Leo Bachmair, Nachum Dershowitz
1986	A*	`conf`	Orderings for Equational Proofs LICS Leo Bachmair, Nachum Dershowitz, Jieh Hsiang
1985	—	`conf`	Associative Path Orderings. RTA Leo Bachmair, David A. Plaisted
1985	J	`jnl`	Termination Orderings for Associative-Commutative Rewriting Systems. J. Symb. Comput. Leo Bachmair, David A. Plaisted
1980	J	`jnl`	A simplified proof of the characterization theorem for Gröbner-bases. SIGSAM Bull. Leo Bachmair, Bruno Buchberger