New results on rewrite-based satisfiability procedures, ACM Transactions on Computational Logic, vol.10, issue.1, pp.1-51, 2009. ,
DOI : 10.1145/1459010.1459014
URL : https://hal.archives-ouvertes.fr/inria-00576862
A rewriting approach to satisfiability procedures, Information and Computation, vol.183, issue.2, pp.140-164, 2003. ,
DOI : 10.1016/S0890-5401(03)00020-8
On Variable-inactivity and Polynomial Formula-Satisfiability Procedures, Journal of Logic and Computation, vol.18, issue.1, pp.77-96, 2008. ,
DOI : 10.1093/logcom/exm055
Superposition with completely built-in Abelian groups, Journal of Symbolic Computation, vol.37, issue.1, pp.1-33, 2004. ,
DOI : 10.1016/S0747-7171(03)00070-1
Automatic decidability, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.7-16, 2002. ,
DOI : 10.1109/LICS.2002.1029813
URL : https://hal.archives-ouvertes.fr/inria-00586936
Automatic decidability and combinability, Information and Computation, vol.209, issue.7, pp.1026-1047, 2011. ,
DOI : 10.1016/j.ic.2011.03.005
URL : https://hal.archives-ouvertes.fr/inria-00586936
Combinable Extensions of Abelian Groups, LNCS, vol.33, issue.6, pp.51-66, 2009. ,
DOI : 10.1006/jsco.2002.0536
URL : https://hal.archives-ouvertes.fr/inria-00428077
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets, LNCS, vol.31, issue.2, pp.428-442, 2009. ,
DOI : 10.1145/2422.322411
URL : https://hal.archives-ouvertes.fr/inria-00331735
Paramodulation-Based Theorem Proving, Handbook of Automated Reasoning, pp.371-443, 2001. ,
DOI : 10.1016/B978-044450813-3/50009-6
A Rule-Based Framework for Building Superposition-Based Decision Procedures, LNCS, vol.7571, pp.221-239, 2012. ,
DOI : 10.1007/978-3-642-34005-5_12
URL : https://hal.archives-ouvertes.fr/hal-00749576
Automatic Decidability for Theories with Counting Operators, p.13, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00920496