Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
94 | Dan Benanav, Deepak Kapur, Paliath Narendran |
Complexity of Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings, pp. 417-429, 1985, Springer, 3-540-15976-2. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
Associative-Commutative, NP-Completeness, Matching, Associative, Commutative |
87 | Patrick Lincoln, Jim Christian |
Adventures in Associative-Commutative Unification (A Summary). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings, pp. 358-367, 1988, Springer, 3-540-19343-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
87 | François Fages |
Associative-Commutative Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 7th International Conference on Automated Deduction, Napa, California, USA, May 14-16, 1984, Proceedings, pp. 194-208, 1984, Springer, 3-540-96022-8. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
78 | David A. Basin |
Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators in Isomorphism Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, Proceedings, pp. 251-260, 1990, Springer, 3-540-52885-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
62 | Leo Bachmair, Ashish Tiwari 0001, Laurent Vigneron |
Abstract Congruence Closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 31(2), pp. 129-168, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
congruence closure, associative-commutative theories, term rewriting |
56 | Catherine Delor, Laurence Puel |
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings, pp. 389-404, 1993, Springer, 3-540-56868-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
55 | Emmanuel Kounalis, Denis Lugiez, Loic Pottier |
A Solution of the Complement Problem in Associative-Commutative Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1991, 16th International Symposium, MFCS'91, Kazimierz Dolny, Poland, September 9-13, 1991, Proceedings, pp. 287-297, 1991, Springer, 3-540-54345-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
The Subsumption Lattice of First-Order terms, Associative and Commutative Reasoning, AC-Disunification, Pattern-Matching, Inductive Learning, Sufficient-Completeness |
55 | Paliath Narendran, Michaël Rusinowitch |
Any Gound Associative-Commutative Theory Has a Finite Canonical System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 423-434, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
50 | Evelyne Contejean |
A Certified AC Matching Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings, pp. 70-84, 2004, Springer, 3-540-22153-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
49 | Leo Bachmair, David A. Plaisted |
Associative Path Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings, pp. 241-254, 1985, Springer, 3-540-15976-2. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
42 | Joachim Steinbach |
Improving Assoviative Path Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, Proceedings, pp. 411-425, 1990, Springer, 3-540-52885-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
39 | Steven Eker |
Associative-Commutative Rewriting on Large Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, pp. 14-29, 2003, Springer, 3-540-40254-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
39 | Pierre-Etienne Moreau, Hélène Kirchner |
A Compiler for Rewrite Programs in Associative-Commutative Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP/ALP ![In: Principles of Declarative Programming, 10th International Symposium, PLILP'98 Held Jointly with the 7th International Conference, ALP'98, Pisa, Italy, September 16-18, 1998, Proceedings, pp. 230-249, 1998, Springer, 3-540-65012-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AC theories, AC many-to-one matching, compilation, rewrite systems |
39 | Laurent Vigneron |
Associative-Commutative Deduction with Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings, pp. 530-544, 1994, Springer, 3-540-58156-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
39 | Leo Bachmair, Ta Chen, I. V. Ramakrishnan |
Associative-Commutative Discrimination Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings, pp. 61-74, 1993, Springer, 3-540-56610-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
39 | Emmanuel Kounalis, Denis Lugiez |
Compilation of Pattern Matching with Associative-Commutative Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'91), pp. 57-73, 1991, Springer, 3-540-53982-4. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
39 | Isabelle Gnaedig, Pierre Lescanne |
Proving Termination of Associative Commutative Rewriting Systems by Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 52-61, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
38 | Ruvim Lipyanski |
Pythagorean Triples in Unification Theory of Nilpotent Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 392-395, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
38 | C. Faure |
A Meta Simplifier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '90, Tokyo, Japan, August 20-24, 1990, pp. 290, 1990, ACM, 0-201-54892-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
31 | Deepak Kapur, G. Sivakumar |
Proving Associative-Communicative Termination Using RPO-Compatible Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTP (LNCS Selection) ![In: Automated Deduction in Classical and Non-Classical Logics, Selected Papers, pp. 39-61, 1998, Springer, 3-540-67190-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
31 | Franz Baader, Klaus U. Schulz |
Combination Techniques and Decision Problems for Disunification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings, pp. 301-315, 1993, Springer, 3-540-56868-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
31 | Ahlem Ben Cherifa, Pierre Lescanne |
An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 42-51, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
31 | Deepak Kapur, Paliath Narendran |
NP-Completeness of the Set Unification and Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 489-495, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
25 | Katherine A. Yelick |
Combining Unification Algorithms for Confined Regular Equational Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings, pp. 365-380, 1985, Springer, 3-540-15976-2. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
24 | Deepak Kapur |
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 19(1), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Jia Huang, Erkko Lehtonen |
The associative-commutative spectrum of a binary operation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(10), pp. 113535, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Deepak Kapur |
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.04793, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Deepak Kapur |
A Modular Associative Commutative (AC) Congruence Closure Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, July 17-24, 2021, Buenos Aires, Argentina (Virtual Conference)., pp. 15:1-15:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-191-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Manuel Krebber |
Non-linear Associative-Commutative Many-to-One Pattern Matching with Sequence Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.00907, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
24 | Wenwen Zong, Yong Su, Huawen Liu, Bernard De Baets |
On the Construction of Associative, Commutative and Increasing Operations by Paving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AGOP ![In: Aggregation Functions in Theory and in Practice, 9th International Summer School on Aggregation Functions, Skövde, Sweden, 19-22 June 2017, pp. 229-240, 2017, Springer, 978-3-319-59305-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Peter Nightingale, Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel |
Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings, pp. 590-605, 2014, Springer, 978-3-319-10427-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune |
Associative-Commutative Deducibility Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 634-645, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Keiichirou Kusakari, Masaki Nakamura 0001, Yoshihito Toyama |
Elimination Transformations for Associative-Commutative Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 37(3), pp. 205-229, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
(AC-)termination, (AC-)dependency pair, argument filtering, elimination transformation |
24 | Roberto Di Cosmo, François Pottier, Didier Rémy |
Subtyping Recursive Types Modulo Associative Commutative Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, pp. 179-193, 2005, Springer, 3-540-25593-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | David Hemer |
Higher-order associative commutative pattern matching for component retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Proceedings of Computing: The Australasian Theory Symposium, CATS 2004, Dunedin, New Zealand, January 19-20, 2004, pp. 116-133, 2004, Elsevier. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Christophe Costa Florêncio |
Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EACL ![In: EACL 2003, 10th Conference of the European Chapter of the Association for Computational Linguistics, April 12-17, 2003, Agro Hotel, Budapest, Hungary, pp. 75-82, 2003, The Association for Computer Linguistics. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
24 | Steven Eker |
Single Elementary Associative-Commutative Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 28(1), pp. 35-51, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Christophe Costa Florêncio |
A Note on the Complexity of Associative-Commutative Lambek Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAG+ ![In: Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks, TAG+ 2002, Venice, Italy, May 20-23, 2002, pp. 159-162, 2002, Association for Computational Linguistics. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
24 | Hélène Kirchner, Pierre-Etienne Moreau |
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Funct. Program. ![In: J. Funct. Program. 11(2), pp. 207-251, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Claude Marché, Xavier Urbain |
Termination of Associative-Commutative Rewriting by Dependency Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings, pp. 241-255, 1998, Springer, 3-540-64301-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Narjes Ben Rajeb |
Preuves par induction implicite: cas des théories associatives-commutatives et observationnelles. (Proofs by implicit induction: case of associative-commutative and observational theories). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1997 |
RDF |
|
24 | Paliath Narendran, Michaël Rusinowitch |
Any Ground Associative-Commutative Theory Has a Finite Canonical System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 17(1), pp. 131-143, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch |
Automated Verification by Induction with Associative-Commutative Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 8th International Conference, CAV '96, New Brunswick, NJ, USA, July 31 - August 3, 1996, Proceedings, pp. 220-231, 1996, Springer, 3-540-61474-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch |
SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings, pp. 428-431, 1996, Springer, 3-540-61464-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Michaël Rusinowitch, Laurent Vigneron |
Automated deduction with associative-commutative operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 6, pp. 23-56, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Steven M. Eker |
Associative-Commutative Matching Via Bipartite Graph Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 38(5), pp. 381-399, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Ta Chen, Siva Anantharaman |
STORM: A MAny-to-One Associative-Commutative Matcher. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, pp. 414-419, 1995, Springer, 3-540-59200-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Leo Bachmair, Ta Chen, I. V. Ramakrishnan, Siva Anantharaman, Jacques Chabin |
Experiments with Associative-Commutative Discrimination Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montréal Québec, Canada, August 20-25 1995, 2 Volumes, pp. 348-355, 1995, Morgan Kaufmann. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
24 | Jean-Luc Moysset |
Décision des problèmes de compléments associatifs-commutatifs. (Decision of associative-commutative complement problems). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1995 |
RDF |
|
24 | Leo Bachmair, Harald Ganzinger |
Associative-Commutative Superposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTRS ![In: Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings, pp. 1-14, 1994, Springer, 3-540-60381-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Leo Bachmair |
Associative-Commutative Reduction Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 43(1), pp. 21-27, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Deepak Kapur, Paliath Narendran |
Complexity of Unification Problems with Associative-Commutative Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 9(2), pp. 261-288, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | E. Paul |
A General Refutational Completeness Result for an Inference Procedure Based on Associative-Commutative Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 14(6), pp. 577-618, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
24 | Nachum Dershowitz, Subrata Mitra |
Path Orderings for Termination of Associative-Commutative Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTRS ![In: Conditional Term Rewriting Systems, Third International Workshop, CTRS-92, Pont-à-Mousson, France, July 8-10, 1992, Proceedings, pp. 168-174, 1992, Springer, 3-540-56393-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Emmanuel Kounalis, Denis Lugiez, Loic Pottier |
A Solution of the Complement Problem in Associative-Commutative Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWWERT ![In: Word Equations and Related Topics, Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991, Proceedings, pp. 197-214, 1991, Springer, 3-540-56730-5. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Michaël Rusinowitch, Laurent Vigneron |
Automated deduction with associative commutative operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAIR ![In: Fundamentals of Artificial Intelligence Research, International Workshop FAIR '91, Smolenice, Czechoslovakia, September 8-13, 1991, Proceedings, pp. 185-199, 1991, Springer, 3-540-54507-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Hantao Zhang 0001, Deepak Kapur |
Unnecessary Inferences in Associative-Commutative Completion Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 23(3), pp. 175-206, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Patrick Lincoln, Jim Christian |
Adventures in Associative-Commutative Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 8(1/2), pp. 217-240, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Ralph W. Wilkerson, Bruce M. McMillin |
Expectations for associative-commutative unification speedups in a multicomputer environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: Proceedings of the 13th Annual International Computer Software and Applications Conference, COMPSAC 1989, Orlando, FL, USA, 20-22 September, 1989, pp. 158-165, 1989, IEEE, 0-8186-1964-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Gaétan Hains |
Parallel algorithms for free and associative-commutative unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1989 |
RDF |
|
24 | Mark E. Stickel |
A Comparison of the Variable-Abstraction and Constant-Abstraction Methods for Associative-Commutative Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 3(3), pp. 285-289, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
24 | François Fages |
Associative-Commutative Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 3(3), pp. 257-275, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Leo Bachmair, David A. Plaisted |
Termination Orderings for Associative-Commutative Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 1(4), pp. 329-349, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
24 | Nachum Dershowitz, Jieh Hsiang, N. Alan Josephson, David A. Plaisted |
Associative-Commutative Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, FRG, August 1983, pp. 940-944, 1983, William Kaufmann. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP BibTeX RDF |
|
24 | Mark E. Stickel |
A Unification Algorithm for Associative-Commutative Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 28(3), pp. 423-434, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
24 | Jean-Marie Hullot |
Associative Commutative Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI 79, Tokyo, Japan, August 20-23, 1979, 2 Volumes, pp. 406-412, 1979, William Kaufmann, 0-934613-47-8. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP BibTeX RDF |
|
24 | Mark E. Stickel |
A Complete Unification Algorithm for Associative-Commutative Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Advance Papers of the Fourth International Joint Conference on Artificial Intelligence, Tbilisi, Georgia, USSR, September 3-8, 1975, pp. 71-76, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP BibTeX RDF |
|
22 | Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch |
Unification Modulo ACUI Plus Distributivity Axioms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 33(1), pp. 1-28, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
equational unification, counter machines, complexity, decidability, rewriting, set constraints, Post correspondence problem |
22 | Deepak Kapur, G. Sivakumar, Hantao Zhang 0001 |
A New Method for Proving Termination of AC-Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings, pp. 133-148, 1990, Springer, 3-540-53487-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Denis Lugiez |
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, pp. 127-140, 2009, Springer, 978-3-642-04419-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Giorgio Delzanno, Roberto Montagna |
Reachability analysis of fragments of mobile ambients in AC term rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 20(4-5), pp. 407-428, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Petri nets, Term rewriting, Reachability, Mobile ambients |
16 | Maria Paola Bonacina, Nachum Dershowitz |
Canonical Inference for Implicational Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings, pp. 380-395, 2008, Springer, 978-3-540-71069-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Cristina Borralleras, Albert Rubio |
Orderings and Constraints: Theory and Practice of Proving Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rewriting, Computation and Proof ![In: Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, pp. 28-43, 2007, Springer, 978-3-540-73146-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Giorgio Delzanno, Roberto Montagna |
Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2006, Third International Colloquium, Tunis, Tunisia, November 20-24, 2006, Proceedings, pp. 302-316, 2006, Springer, 3-540-48815-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Gregory J. Duck, Peter J. Stuckey, Sebastian Brand |
ACD Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 117-131, 2006, Springer, 3-540-36635-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Martín Abadi, Véronique Cortier |
Deciding Knowledge in Security Protocols under (Many More) Equational Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSFW ![In: 18th IEEE Computer Security Foundations Workshop, (CSFW-18 2005), 20-22 June 2005, Aix-en-Provence, France, pp. 62-76, 2005, IEEE Computer Society, 0-7695-2340-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick |
On the Complexity of Equational Horn Clauses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings, pp. 337-352, 2005, Springer, 3-540-28005-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch |
ACID-Unification Is NEXPTIME-Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 169-178, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
E-Unification, Dag automata, Complexity, Tree automata, Set constraints |
16 | Phokion G. Kolaitis, Thomas Raffill |
In Search of a Phase Transition in the AC-Matching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, pp. 433-450, 2001, Springer, 3-540-42863-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Jean-Yves Girard 0001 |
Locus Solum: From the Rules of Logic to the Logic of Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 38, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Ashish Tiwari 0001 |
Rewrite Closure for Ground and Cancellative AC Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings, pp. 334-346, 2001, Springer, 3-540-43002-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Deepak Kapur, Mahadevan Subramaniam |
Extending Decision Procedures with Induction Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-17, 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000, Proceedings, pp. 324-345, 2000, Springer, 3-540-67664-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Arnaud Durand 0001, Miki Hermann, Laurent Juban |
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings, pp. 92-102, 1999, Springer, 3-540-66408-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Roberto Di Cosmo, Stefano Guerrini |
Strong Normalization of Proof Nets Modulo Structural Congruences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 75-89, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Linear Logic, Proof Nets, Strong Normalization |
16 | Maria C. F. Ferreira, A. L. Ribeiro |
Context-Sensitive AC-Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 286-300, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Julien Zory, Fabien Coelho |
Using Algebraic Transformations to Optimize Expression Evaluation in Scientific Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998, pp. 376-384, 1998, IEEE Computer Society, 0-8186-8591-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Algebraic transformation, Fused multiply-add operation, Instruction-Level Parallelism, Expression evaluation |
16 | Deepak Kapur, G. Sivakumar |
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings, pp. 142-156, 1997, Springer, 3-540-62950-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Konrad Slind |
AC Unification in HOL90. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HUG ![In: Higher Order Logic Theorem Proving and its Applications, 6th International Workshop, HUG '93, Vancouver, BC, Canada, August 11-13, 1993, Proceedings, pp. 436-449, 1993, Springer, 3-540-57826-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Georgios Grivas, Roman Maeder |
Matching and Unification for the Object-Oriented Symbolic Computation System AlgBench. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISCO ![In: Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO '93, Gmunden, Austria, September 15-17, 1993, Proceedings, pp. 164-176, 1993, Springer, 3-540-57235-X. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Hubert Comon |
Complete Axiomatizations of Some Quotient Term Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 469-480, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
16 | Joachim Steinbach |
AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, Second International Conference, Nancy, France, October 1-3, 1990, Proceedings, pp. 372-386, 1990, Springer, 3-540-53162-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Ralph W. Wilkerson, Blayne E. Mayfield |
The Role of Term Symmetry in E-Completion Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, CSC '90, Sheraton Washington Hotel, Washington, DC, USA, February 20-22, 1990, pp. 134-139, 1990, ACM, 0-89791-348-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Mohamed Adi, Claude Kirchner |
AC-Unification Race: The System Solving Approach And Its Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISCO ![In: Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO '90, Capri, Italy, April 10-12, 1990, Proceedings, pp. 174-183, 1990, Springer, 3-540-52531-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Rakesh M. Verma, I. V. Ramakrishnan |
Some Complexity Theoretic Aspects of AC Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings, pp. 407-420, 1989, Springer, 3-540-50840-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
16 | Hantao Zhang 0001, Deepak Kapur |
Consider Only General Superpositions in Completion Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings, pp. 513-527, 1989, Springer, 3-540-51081-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
16 | Mark Franzen, Lawrence J. Henschen |
A New Approach to Universal Unification and Its Application to AC-Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings, pp. 643-657, 1988, Springer, 3-540-19343-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
16 | Barbara A. Smith, Ralph W. Wilkerson, Gerald E. Peterson |
Automated Circuit Diagnosis Using First Order Logic Tools. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE (Vol. 1) ![In: Proceedings of the First International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, IEA/AIE 1988, June 1-3, 1988, Tullahoma, TN, USA. ACM, 1988 - Volume 1, pp. 456-465, 1988, ACM, 0-89791-271-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
16 | Leo Bachmair, Nachum Dershowitz |
Commutation, Transformation, and Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 5-20, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|