☰

Leo Bachmair - Publications

Affiliations: 
Computer Science Stony Brook University, Stony Brook, NY, United States 
Area:
Computational Logic, Automated Deduction, Symbolic Computation.
Tree Info Similar researchers PubMed Report error

25 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2003 Bachmair L, Tiwari A, Vigneron L. Abstract congruence closure Journal of Automated Reasoning. 31: 129-168. DOI: 10.1023/B:Jars.0000009518.26415.49  0.477
2000 Tiwari A, Bachmair L, Ruess H. Rigid E-unification revisited Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 1831: 220-234.  0.375
2000 Bachmair L, Ramakrishnan IV, Tiwari A, Vigneron L. Congruence closure modulo associativity and commutativity? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1794: 245-259.  0.444
2000 Bachmair L, Tiwari A. Abstract congruence closure and specializations Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 1831: 64-78.  0.36
1999 Bachmair L, Ramakrishnan CR, Ramakrishnan IV, Tiwari A. Normalization via rewrite closures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1631: 190-204. DOI: 10.1007/3-540-48685-2_15  0.319
1998 Bachmair L, Ganzinger H. Ordered chaining calculi for first-order theories of transitive relations Journal of the Acm. 45: 1007-1049. DOI: 10.1145/293347.293352  0.413
1998 Bachmair L, Ganzinger H, Voronkov A. Elimination of equality via transformation with ordering constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1421: 175-190.  0.43
1998 Bachmair L, Ganzinger H. Strict basic superposition Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1421: 160-174.  0.335
1998 Lifantsev M, Bachmair L. An LPO-based termination ordering for higher-order terms without λ-abstraction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1479: 277-293.  0.408
1997 Bachmair L. Paramodulation superposition, and simplification Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1289: 1-3. DOI: 10.1007/3-540-63385-5_28  0.435
1997 Bachmair L, Tiwari A. D-bases for polynomial ideals over commutative Noetherian rings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1232: 113-127.  0.31
1995 Bachmair L, Ganzinger H, Lynch C, Snyder W. Basic Paramodulation Information and Computation. 121: 172-192. DOI: 10.1006/Inco.1995.1131  0.47
1995 Bachmair L, Ganzinger H, Stuber J. Combining algebra and universal algebra in first-order theorem proving: The case of commutative rings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 906: 1-29.  0.455
1994 Bachmair L, Dershowitz N. Equational Inference, Canonical Proofs, and Proof Orderings Journal of the Acm (Jacm). 41: 236-276. DOI: 10.1145/174652.174655  0.508
1994 Bachmair L, Ganzinger H. Rewrite-based equational theorem proving with selection and simplification Journal of Logic and Computation. 4: 217-247. DOI: 10.1093/Logcom/4.3.217  0.54
1994 Bachmair L, Ganzinger H, Waldmann U. Refutational theorem proving for hierarchic first-order theories Applicable Algebra in Engineering, Communication and Computing. 5: 193-212. DOI: 10.1007/Bf01190829  0.45
1994 Bachmair L, Ganzinger H. Rewrite techniques for transitive relations Proceedings - Symposium On Logic in Computer Science. 384-393.  0.333
1993 Bachmair L, Ganzinger H, Waldmann U. Set constraints are the monadic class Proceedings - Symposium On Logic in Computer Science. 75-83.  0.318
1992 Bachmair L. Associative-commutative reduction orderings Information Processing Letters. 43: 21-27. DOI: 10.1016/0020-0190(92)90024-P  0.525
1989 Bachmair L, Dershowitz N. Completion for rewriting modulo a congruence Theoretical Computer Science. 67: 173-201. DOI: 10.1016/0304-3975(89)90003-0  0.453
1988 Bachmair L, Dershowitz N. Critical pair criteria for completion Journal of Symbolic Computation. 6: 1-18. DOI: 10.1016/S0747-7171(88)80018-X  0.529
1988 Bachmair L. Proof by consistency in equational theories . 228-233.  0.433
1987 Bachmair L, Dershowitz N. INFERENCE RULES FOR REWRITE-BASED FIRST-ORDER THEOREM PROVING . 331-337.  0.446
1986 Bachmair L, Dershowitz N, Hsiang J. ORDERINGS FOR EQUATIONAL PROOFS . 346-357.  0.502
1985 Bachmair L, Plaisted DA. Termination orderings for associative-commutative rewriting systems Journal of Symbolic Computation. 1: 329-349. DOI: 10.1016/S0747-7171(85)80019-5  0.527
Show low-probability matches.