A Visual Interactive Framework for Formal Derivation.

Leo Bachmair Paul Agron Leo Bachmair Frank Nielsen A Visual Interactive Framework for Formal Derivation. 1019-1026 2005 conf/iccS/2005-1 International Conference on Computational Science (1) https://doi.org/10.1007/11428831_127 db/conf/iccS/iccS2005-1.html#AgronBN05 Christelle Scharff Leo Bachmair On the Combination of Congruence Closure and Completion. 103-117 https://doi.org/10.1007/978-3-540-30210-0_10 2004 conf/aisc/2004 AISC db/conf/aisc/aisc2004.html#ScharffB04

Leo Bachmair Ashish Tiwari 0001 Laurent Vigneron Abstract Congruence Closure. 129-168 2003 31 J. Autom. Reason. 2 https://doi.org/10.1023/B:JARS.0000009518.26415.49 db/journals/jar/jar31.html#BachmairTV03

Leo Bachmair Harald Ganzinger Resolution Theorem Proving. 19-99 2001 books/el/RobinsonV01 Handbook of Automated Reasoning db/books/collections/RobinsonV01.html#BachmairG01 https://doi.org/10.1016/b978-044450813-3/50004-7 Leo Bachmair Ashish Tiwari 0001 Abstract Congruence Closure and Specializations. 64-78 2000 conf/cade/2000 CADE db/conf/cade/cade2000.html#BachmairT00 https://doi.org/10.1007/10721959_5 Ashish Tiwari 0001 Leo Bachmair Harald Rueß Rigid <i>E</i>-Unification Revisited. 220-234 2000 conf/cade/2000 CADE db/conf/cade/cade2000.html#TiwariBR00 https://doi.org/10.1007/10721959_17 Leo Bachmair I. V. Ramakrishnan Ashish Tiwari 0001 Laurent Vigneron Congruence Closure Modulo Associativity and Commutativity. 245-259 2000 conf/frocos/2000 FroCoS db/conf/frocos/frocos2000.html#BachmairRTV00 https://doi.org/10.1007/10720084_16 Leo Bachmair Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, Proceedings RTA Lecture Notes in Computer Science 1833 Springer 2000 3-540-67778-X https://doi.org/10.1007/10721975 db/conf/rta/rta2000.html Leo Bachmair C. R. Ramakrishnan 0001 I. V. Ramakrishnan Ashish Tiwari 0001 Normalization via Rewrite Closures. 190-204 https://doi.org/10.1007/3-540-48685-2_15 1999 conf/rta/1999 RTA db/conf/rta/rta99.html#BachmairRRT99

Leo Bachmair Harald Ganzinger Ordered Chaining Calculi for First-Order Theories of Transitive Relations. 1007-1049 1998 45 J. ACM 6 https://doi.org/10.1145/293347.293352 db/journals/jacm/jacm45.html#BachmairG98

Leo Bachmair Harald Ganzinger Strict Basic Superposition. 160-174 1998 conf/cade/1998 CADE db/conf/cade/cade98.html#BachmairG98 https://doi.org/10.1007/BFb0054258 Leo Bachmair Harald Ganzinger Andrei Voronkov Elimination of Equality via Transformation with Ordering Constraints. 175-190 1998 conf/cade/1998 CADE db/conf/cade/cade98.html#BachmairGV98 https://doi.org/10.1007/BFb0054259 Maxim Lifantsev Leo Bachmair An LPO-based Termination Ordering for Higher-Order Terms without lambda-abstraction. 277-293 1998 conf/tphol/1998 TPHOLs db/conf/tphol/tphol98.html#LifantsevB98 https://doi.org/10.1007/BFb0055142 Leo Bachmair Paramodulation, Superposition, and Simplification. 1-3 1997 conf/kgc/1997 Kurt Gödel Colloquium db/conf/kgc/kgc97.html#Bachmair97 https://doi.org/10.1007/3-540-63385-5_28 Leo Bachmair Ashish Tiwari 0001 D-Bases for Polynomial Ideals over Commutative Noetherian Rings. 113-127 1997 conf/rta/1997 RTA db/conf/rta/rta97.html#BachmairT97 https://doi.org/10.1007/3-540-62950-5_65 Leo Bachmair Ta Chen C. R. Ramakrishnan 0001 I. V. Ramakrishnan Subsumption Algorithms Based on Search Trees. 135-148 1996 conf/caap/1996 CAAP db/conf/caap/caap96.html#BachmairCRR96 https://doi.org/10.1007/3-540-61064-2_34

Basic Paramodulation Leo Bachmair Harald Ganzinger Christopher Lynch Wayne Snyder 172-192 Inf. Comput. September 1995 121 2 db/journals/iandc/iandc121.html#BachmairGLS95 https://doi.org/10.1006/inco.1995.1131

Leo Bachmair Ta Chen I. V. Ramakrishnan Siva Anantharaman Jacques Chabin Experiments with Associative-Commutative Discrimination Nets. 348-355 1995 conf/ijcai/1995 IJCAI db/conf/ijcai/ijcai95.html#BachmairCRAC95 http://ijcai.org/Proceedings/95-1/Papers/046.pdf

Leo Bachmair Harald Ganzinger Uwe Waldmann Refutational Theorem Proving for Hierarchic First-Order Theories. 193-212 1994 5 Appl. Algebra Eng. Commun. Comput. db/journals/aaecc/aaecc5.html#BachmairGW94 https://doi.org/10.1007/BF01190829

Leo Bachmair Nachum Dershowitz Equational Inference, Canonical Proofs, and Proof Orderings. 236-276 1994 41 J. ACM 2 db/journals/jacm/jacm41.html#BachmairD94 https://doi.org/10.1145/174652.174655

Leo Bachmair Harald Ganzinger Rewrite-Based Equational Theorem Proving with Selection and Simplification. 217-247 1994 4 J. Log. Comput. 3 db/journals/logcom/logcom4.html#BachmairG94 https://doi.org/10.1093/logcom/4.3.217

Leo Bachmair Harald Ganzinger Ordered Chaining for Total Orderings. 435-450 1994 conf/cade/1994 CADE db/conf/cade/cade94.html#BachmairG94 https://doi.org/10.1007/3-540-58156-1_32 Leo Bachmair Harald Ganzinger Buchberger's Algorithm: A Constraint-Based Completion Procedure. 285-301 1994 conf/ccl/1994 CCL db/conf/ccl/ccl94.html#BachmairG94 https://doi.org/10.1007/BFb0016860 Leo Bachmair Harald Ganzinger Jürgen Stuber Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings. 1-29 1994 conf/compass/1994 COMPASS/ADT db/conf/compass/compass94.html#BachmairGS94 https://doi.org/10.1007/BFb0014420 Leo Bachmair Harald Ganzinger Associative-Commutative Superposition. 1-14 1994 conf/ctrs/1994 CTRS db/conf/ctrs/ctrs94.html#BachmairG94 https://doi.org/10.1007/3-540-60381-6_1 Rewrite Techniques for Transitive Relations Leo Bachmair Harald Ganzinger 384-393 1994 conf/lics/1994 LICS db/conf/lics/lics94.html#BachmairG94 https://doi.org/10.1109/LICS.1994.316051 https://doi.ieeecomputersociety.org/10.1109/LICS.1994.316051 Leo Bachmair Harald Ganzinger Uwe Waldmann Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality. 83-96 1993 conf/kgc/1993 Kurt Gödel Colloquium db/conf/kgc/kgc93.html#BachmairGW93 https://doi.org/10.1007/BFb0022557 Set Constraints are the Monadic Class Leo Bachmair Harald Ganzinger Uwe Waldmann 75-83 1993 conf/lics/1993 LICS db/conf/lics/lics93.html#BachmairGW93 https://doi.org/10.1109/LICS.1993.287598 https://doi.ieeecomputersociety.org/10.1109/LICS.1993.287598 Leo Bachmair Rewrite Techniques in Theorem Proving (Abstract). 1 1993 conf/rta/1993 RTA db/conf/rta/rta93.html#Bachmair93 https://doi.org/10.1007/978-3-662-21551-7_1 Leo Bachmair Ta Chen I. V. Ramakrishnan Associative-Commutative Discrimination Nets. 61-74 1993 conf/tapsoft/1993 TAPSOFT db/conf/tapsoft/tapsoft93.html#BachmairCR93 https://doi.org/10.1007/3-540-56610-4_56

Leo Bachmair Associative-Commutative Reduction Orderings. 21-27 1992 43 Inf. Process. Lett. 1 db/journals/ipl/ipl43.html#Bachmair92 https://doi.org/10.1016/0020-0190(92)90024-P

Leo Bachmair Harald Ganzinger Uwe Waldmann Theorem Proving for Hierarchic First-Order Theories. 420-434 1992 conf/alp/1992 ALP db/conf/alp/alp92.html#BachmairGW92 https://doi.org/10.1007/BFb0013841 Leo Bachmair Harald Ganzinger Christopher Lynch Wayne Snyder Basic Paramodulation and Superposition. 462-476 1992 conf/cade/1992 CADE db/conf/cade/cade92.html#BachmairGLS92 https://doi.org/10.1007/3-540-55602-8_185 Leo Bachmair Harald Ganzinger Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria. 273-284 1992 conf/lpar/1992 LPAR db/conf/lpar/lpar92.html#BachmairG92 https://doi.org/10.1007/BFb0013068 Leo Bachmair Harald Ganzinger Perfect Model Semantics for Logic Programs with Equality. 645-659 1991 conf/iclp/1991 ICLP db/conf/iclp/iclp91.html#BachmairG91 Leo Bachmair Harald Ganzinger On Restrictions of Ordered Paramodulation with Simplification. 427-441 1990 conf/cade/1990 CADE db/conf/cade/cade90.html#BachmairG90 https://doi.org/10.1007/3-540-52885-7_105 Leo Bachmair Harald Ganzinger Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract). 162-180 1990 conf/ctrs/1990 CTRS db/conf/ctrs/ctrs90.html#BachmairG90 https://doi.org/10.1007/3-540-54317-1_89

Leo Bachmair Nachum Dershowitz Completion for Rewriting Modulo a Congruence. 173-201 1989 67 Theor. Comput. Sci. 2&3 db/journals/tcs/tcs67.html#BachmairD89 https://doi.org/10.1016/0304-3975(89)90003-0

Leo Bachmair Proof Normalization for Resolution and Paramodulation. 15-28 1989 conf/rta/1989 RTA db/conf/rta/rta89.html#Bachmair89 https://doi.org/10.1007/3-540-51081-8_97

Leo Bachmair Nachum Dershowitz Critical Pair Criteria for Completion. 1-18 1988 6 J. Symb. Comput. 1 db/journals/jsc/jsc6.html#BachmairD88 https://doi.org/10.1016/S0747-7171(88)80018-X

Leo Bachmair Proof by Consistency in Equational Theories 228-233 1988 conf/lics/1988 LICS db/conf/lics/lics88.html#Bachmair88 https://doi.org/10.1109/LICS.1988.5122 https://doi.ieeecomputersociety.org/10.1109/LICS.1988.5122 Leo Bachmair Nachum Dershowitz A critical pair criterion for completion modulo a congruence. 452-453 1987 conf/eurocal/1987 EUROCAL db/conf/eurocal/eurocal1987.html#BachmairD87 https://doi.org/10.1007/3-540-51517-8_151 Leo Bachmair Nachum Dershowitz Inference Rules for Rewrite-Based First-Order Theorem Proving 331-337 conf/lics/1987 1987 LICS db/conf/lics/lics87.html#BachmairD87 Leo Bachmair Nachum Dershowitz Completion for Rewriting Modulo a Congruence. 192-203 1987 conf/rta/87 RTA db/conf/rta/rta87.html#BachmairD87 https://doi.org/10.1007/3-540-17220-3_17 Leo Bachmair Nachum Dershowitz Commutation, Transformation, and Termination. 5-20 1986 conf/cade/1986 CADE db/conf/cade/cade86.html#BachmairD86 https://doi.org/10.1007/3-540-16780-3_76 Leo Bachmair Nachum Dershowitz Critical-pair criteria for the Knuth-Bendix completion procedure. 215-217 1986 SYMSAC https://doi.org/10.1145/32439.32481 conf/issac/1986 db/conf/issac/symsac1986.html#BachmairD86 Leo Bachmair Nachum Dershowitz Jieh Hsiang Orderings for Equational Proofs 346-357 conf/lics/1986 1986 LICS db/conf/lics/lics86.html#BachmairDH86

Leo Bachmair David A. Plaisted Termination Orderings for Associative-Commutative Rewriting Systems. 329-349 1985 1 J. Symb. Comput. 4 db/journals/jsc/jsc1.html#BachmairP85 https://doi.org/10.1016/S0747-7171(85)80019-5

Leo Bachmair David A. Plaisted Associative Path Orderings. 241-254 1985 conf/rta/1985 RTA db/conf/rta/rta85.html#BachmairP85 https://doi.org/10.1007/3-540-15976-2_11

Leo Bachmair Bruno Buchberger A simplified proof of the characterization theorem for Gröbner-bases. 29-34 1980 14 SIGSAM Bull. 4 https://doi.org/10.1145/1089235.1089238 db/journals/cca/cca14.html#BachmairB80

Paul Agron Siva Anantharaman Bruno Buchberger Jacques Chabin Ta Chen Nachum Dershowitz Harald Ganzinger Jieh Hsiang Maxim Lifantsev Christopher Lynch Frank Nielsen David A. Plaisted C. R. Ramakrishnan 0001 I. V. Ramakrishnan Harald RuessHarald Rueß Christelle Scharff Wayne Snyder Jürgen Stuber Ashish Tiwari 0001 Laurent Vigneron Andrei Voronkov Uwe Waldmann