Вы здесь

Ganzinger H.

Автор:

Вид Название Год Автор Серия Редакторы Колл. автор Источник Дата поступления
СТ Buchberger s Algorithm: A Constraint-Based Completion Procedure 1994 Bachmair L., Ganzinger H. Lecture Notes in Computer Science 01.10.1994
СТ Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings 1995 Bachmair L., Ganzinger H., Stuber J. Lecture Notes in Computer Science 24.05.1995
СТ Integrating Equational Reasoning into Instantiation-Based Theorem Proving 2004 Ganzinger H., Korovin K. Lecture Notes in Computer Science Lecture Notes in Computer Science 23.12.2004
СТ Order-sorted completion: the many-sorted way 1991 Ganzinger H. Theoretical Computer Science 28.11.1991
СТ Perfect Model Semantics for Logic Programs with Equality 1991 Bachmair L., Ganzinger H. Logic Programming: Proc./Eight Intern. Conf. 23.09.1994
СТ Rigid Reachability 1998 Ganzinger H., Jacquemard F., Veanes M. Lecture Notes in Computer Science 18.12.1998
СТ Superposition with Simplification as a Decision Procedure for the Monadic Class with Equality 1993 Bachmair L., Ganzinger H., Waldmann U. Lecture Notes in Computer Science 21.09.1993