Author:
Armando Alessandro,Ranise Silvio,Rusinowitch Michaël
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference39 articles.
1. A practical extension mechanism for decision procedures: the case study of universal presburger arithmetic;Armando;J. Univ. Comput. Sci.,2001
2. A. Armando, S. Ranise, M. Rusinowitch, Uniform derivation of decision procedures by superposition, in: Computer Science Logic (CSL01), Paris, France, 10–13 September, 2001
3. Rewrite-based equational theorem proving with selection and simplification;Bachmair;J. Logic Comput.,1994
4. L. Bachmair, I.V. Ramakrishnan, A. Tiwari, L. Vigneron, Congruence closure modulo associativity and commutativity, in: Frontiers of Comb. Sys.’s (FroCos’2000), LNCS, vol. 1794, 2000, pp. 245–259
5. L. Bachmair, A. Tiwari, Abstract congruence closure and specializations, in: D.A. McAllester (Ed.), 17th CADE, LNAI, vol. 1831, 2000, pp. 64–78
Cited by
85 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Equational theorem proving for clauses over strings;Mathematical Structures in Computer Science;2024-04-18
2. Equational Theorem Proving for Clauses over Strings;Electronic Proceedings in Theoretical Computer Science;2023-03-23
3. Chapter 33. Satisfiability Modulo Theories;Frontiers in Artificial Intelligence and Applications;2021-02-02
4. Politeness and Combination Methods for Theories with Bridging Functions;Journal of Automated Reasoning;2019-01-22
5. Theory Combination: Beyond Equality Sharing;Lecture Notes in Computer Science;2019