Author:
Bensaid Hicham,Peltier Nicolas
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference24 articles.
1. Amaniss, A., Hermann, M., Lugiez, D.: Set operations for recurrent term schematizations. In: TAPSOFT, pp. 333–344 (1997). citeseer.ist.psu.edu/article/amaniss97set.html
2. Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, chap. 8, pp. 445–532. Elsevier Science (2001)
3. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. Log Comput. 3(4), 217–247 (1994)
4. Bensaid, H., Caferra, R., Peltier, N.: Towards systematic analysis of theorem provers search spaces: First steps. In: Proceedings of Wollic’07 (Workshop on Logic, Language, Information and Computation), LNCS, vol. 4576, pp. 38–52. Springer (2007)
5. Bensaid, H., Caferra, R., Peltier, N.: I-terms in ordered resolution and superposition calculi : retrieving lost completeness. In: AISC 2010 (10th International Conference on Artificial Intelligence and Symbolic Computation), LNCS, pp. 19–33 (2010)