Search Results - 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

Authors: Mark E. Stickel Gerald E. Peterson

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

Subject Terms: 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.)

File Description: application/xml

Access URL: 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

Computing in Complete Local Equicharacteristic Noetherian Rings Via Topological Rewriting on Commutative Formal Power Series.

Authors: Musson-Leymarie, Adya

Source: Mathematics in Computer Science; 11/21/2025, Vol. 19 Issue 1, p1-29, 29p

LEFT-LINEAR COMPLETION WITH AC AXIOMS.

Authors: NIEDERHAUSER, JOHANNES NAO HIROKAWA MIDDELDORP, AART

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 2, p1-44, 44p

Subject Terms: AXIOMS, LITERATURE

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure.

Authors: BONCHI, FILIPPO GADDUCCI, FABIO KISSINGER, ALEKS et al.

Source: Journal of the ACM; Mar2022, Vol. 69 Issue 2, p1-58, 58p

Subject Terms: FROBENIUS algebras, FLOWGRAPHS, QUANTUM theory, STRING theory, ELECTRIC circuits, UNIFIED modeling language, GRAPH algorithms

A rewriting coherence theorem with applications in homotopy type theory.

Authors: Kraus, Nicolai von Raumer, Jakob

Source: Mathematical Structures in Computer Science; Aug2022, Vol. 32 Issue 7, p982-1014, 33p

Subject Terms: HOMOTOPY theory, HOMOTOPY groups, FREE groups, CONSTRUCTIVE mathematics, OPEN-ended questions, HOMOTOPY equivalences, NORMAL forms (Mathematics)

AN EXAMPLE OF A QUASI-COMMUTATIVE INVERSE SEMIGROUP.

Authors: SOROUHESH, MOHAMMAD REZA CAMPBELL, COLIN M.

Source: International Journal of Group Theory; Mar2024, Vol. 13 Issue 1, p115-122, 8p

Subject Terms: CONCRETE, ALGORITHMS

REWRITING AND COMPLETENESS OF SUM-OVER-PATHS IN DYADIC FRAGMENTS OF QUANTUM COMPUTING.

Authors: VILMART, RENAUD

Source: Logical Methods in Computer Science (LMCS); 2024, Vol. 20 Issue 1, p1-35, 35p, 3 Graphs

Tangent complexes and the Diamond Lemma.

Authors: Dotsenko, Vladimir Tamaroff, Pedro

Source: Bulletin of Mathematical Sciences (World Scientific); Dec2024, Vol. 14 Issue 3, p1-32, 32p

Subject Terms: RELATION algebras, GROBNER bases, ASSOCIATIVE algebras, DIAMONDS, ALGEBRA

Paramodulation with Non-Monotonic Orderings and Simplification.

Authors: Bofill, Miquel Rubio, Albert

Source: Journal of Automated Reasoning; Jan2013, Vol. 50 Issue 1, p51-98, 48p

Subject Terms: NONMONOTONIC logic, LINEAR orderings, CALCULUS, REASONING, SET theory

Rewriting with generalized nominal unification.

Authors: Kutz, Yunus Schmidt-Schauß, Manfred

Source: Mathematical Structures in Computer Science; Jun2020, Vol. 30 Issue 6, p710-735, 26p

Subject Terms: ATOMS

Deciding the Word Problem for Ground and Strongly Shallow Identities w.r.t. Extensional Symbols.

Authors: Baader, Franz Kapur, Deepak

Source: Journal of Automated Reasoning; Aug2022, Vol. 66 Issue 3, p301-329, 29p

Subject Terms: POLYNOMIAL time algorithms, SIGNS & symbols, DESCRIPTION logics, DECISION making

Slothrop: Knuth-Bendix Completion with a Modern Termination Checker.

Authors: Pfenning, Frank Wehrman, Ian Stump, Aaron et al.

Source: Term Rewriting & Applications (9783540368342); 2006, p287-296, 10p

Semantically-Guided Goal-Sensitive Reasoning: Decision Procedures and the Koala Prover.

Authors: Bonacina, Maria Paola Winkler, Sarah

Source: Journal of Automated Reasoning; Mar2023, Vol. 67 Issue 1, p1-42, 42p

Formalizing Bachmair and Ganzinger's Ordered Resolution Prover.

Authors: Schlichtkrull, Anders Blanchette, Jasmin Traytel, Dmitriy et al.

Source: Journal of Automated Reasoning; Oct2020, Vol. 64 Issue 7, p1169-1195, 27p

Subject Terms: AUTOMATIC theorem proving, ALGORITHMS, MATHEMATICAL models, PROGRAMMING languages, ALGORITHM research

The Generation Problem in Thompson Group F.

Authors: Polak, Gili Golan

Source: Memoirs of the American Mathematical Society; Dec2023, Vol. 292 Issue 1451, p1-106, 106p

Compositional Verification in Rewriting Logic.

Authors: MARTÍN, ÓSCAR VERDEJO, ALBERTO MARTÍ-OLIET, NARCISO

Source: Theory & Practice of Logic Programming; Jan2024, Vol. 24 Issue 1, p57-109, 53p

Subject Terms: CONFIRMATION (Logic), LOGIC programming, SATISFACTION, INTUITION, THEORY-practice relationship

Confluence of algebraic rewriting systems.

Authors: Chenavier, Cyrille Dupont, Benjamin Malbos, Philippe

Source: Mathematical Structures in Computer Science; Aug2022, Vol. 32 Issue 7, p870-897, 28p

Subject Terms: GROUP algebras, LIE detectors & detection, LINEAR algebra, STATISTICAL decision making, AXIOMS

The HOM Problem is EXPTIME-Complete.

Authors: Creus, Carles Gascon, Adria Godoy, Guillem et al.

Source: 2012 27th Annual IEEE Symposium on Logic in Computer Science; 1/ 1/2012, p255-264, 10p

Set of Support, Demodulation, Paramodulation: A Historical Perspective.

Authors: Bonacina, Maria Paola

Source: Journal of Automated Reasoning; Nov2022, Vol. 66 Issue 4, p463-497, 35p

Subject Terms: DEMODULATION, DEFINITIONS

Knuth–Bendix for Groups with Infinitely Many Rules.

Authors: Epstein, D. B. A. Sanders, P. J. Margolis, S.

Source: International Journal of Algebra & Computation; Oct2000, Vol. 10 Issue 5, p539, 51p

Subject Terms: GROUP schemes (Mathematics), FINITE groups