Výsledky vyhledávání - "extension of the Knuth-Bendix algorithm for finding complete sets of reductions"

Complete Sets of Reductions for Some Equational Theories: Complete sets of reductions for some equational theories

Autoři: Mark E. Stickel Gerald E. Peterson

Zdroj: Journal of the ACM. 28:233-264

Témata: complete unification algorithms, Software, source code, etc. for problems pertaining to general algebraic systems, finite termination property, free commutative groups, 0102 computer and information sciences, 02 engineering and technology, Boolean algebra, 01 natural sciences, distributive lattices, unique termination property, extension of the Knuth-Bendix algorithm for finding complete sets of reductions, theory of a finite number of associative and commutative functions, 0202 electrical engineering, electronic engineering, information engineering, commutative rings with unit, well-founded partial order, Theorem proving (deduction, resolution, etc.)

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jacm/jacm28.html#PetersonS81
https://dl.acm.org/doi/10.1145/322248.322251
https://dl.acm.org/ft_gateway.cfm?id=322251&type=pdf
https://doi.org/10.1145/322248.322251