The New WALDMEISTER Loop at Work-Reference-Cited by-同舟云学术

The New WALDMEISTER Loop at Work

Published:2003 Issue: Volume: Page:317-321
ISSN:0302-9743
Container-title:Automated Deduction – CADE-19
language:
Short-container-title:

Author:

Gaillourdet Jean-Marie,Hillenbrand Thomas,Löchner Bernd,Spies Hendrik

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45085-6_27

Reference9 articles.

1. Bachmair, L., Dershowitz, N., Plaisted, D.A.: Completion without failure. In: Resolution of Equations in Algebraic Structures, vol. 2, pp. 1–30. Academic Press, London (1989)

2. Bündgen, R., Göbel, M., Küchlin, W., Weber, A.: Parallel term rewriting with PaReDuX. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction—A Basis for Applications: Systems and Implementation Techniques, vol. II, pp. 231–260. Kluwer Academic Publishers, Dordrecht (1998)

3. Bonacina, M.P.: A taxonomy of parallel strategies for deduction. Annals of Mathematics and Artificial Intelligence 29(1–4), 223–257 (2000)

4. Denzinger, J., Fuchs, D.: Cooperation of heterogeneous provers. In: Dean, T. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 10–15. Morgan Kaufmann, San Francisco (1999)

5. Lecture Notes in Artificial Intelligence;T. Hillenbrand,2002

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Analysis of Rewriting-Based Systems as First-Order Theories;Logic-Based Program Synthesis and Transformation;2018

2. History and Prospects for First-Order Automated Deduction;Automated Deduction - CADE-25;2015

3. On Transfinite Knuth-Bendix Orders;Lecture Notes in Computer Science;2011

4. Chapter 1 Knowledge Representation and Classical Logic;Handbook of Knowledge Representation;2008

5. Feasible Trace Reconstruction for Rewriting Approximations;Lecture Notes in Computer Science;2006