Suchergebnisse - 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

Autoren: Mark E. Stickel Gerald E. Peterson

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

Schlagwörter: 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.)

Dateibeschreibung: application/xml

Zugangs-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.

Autoren: Musson-Leymarie, Adya

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

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure.

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

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

Schlagwörter: FROBENIUS algebras, FLOWGRAPHS, QUANTUM theory, STRING theory, ELECTRIC circuits, UNIFIED modeling language, GRAPH algorithms

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

Autoren: VILMART, RENAUD

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

Rewriting with generalized nominal unification.

Autoren: Kutz, Yunus Schmidt-Schauß, Manfred

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

Schlagwörter: ATOMS

Tangent complexes and the Diamond Lemma.

Autoren: Dotsenko, Vladimir Tamaroff, Pedro

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

Schlagwörter: RELATION algebras, GROBNER bases, ASSOCIATIVE algebras, DIAMONDS, ALGEBRA

A rewriting coherence theorem with applications in homotopy type theory.

Autoren: Kraus, Nicolai von Raumer, Jakob

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

Schlagwörter: HOMOTOPY theory, HOMOTOPY groups, FREE groups, CONSTRUCTIVE mathematics, OPEN-ended questions, HOMOTOPY equivalences, NORMAL forms (Mathematics)

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

Autoren: Bonacina, Maria Paola

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

Schlagwörter: DEMODULATION, DEFINITIONS

Confluence of algebraic rewriting systems.

Autoren: Chenavier, Cyrille Dupont, Benjamin Malbos, Philippe

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

Schlagwörter: GROUP algebras, LIE detectors & detection, LINEAR algebra, STATISTICAL decision making, AXIOMS

Finite Satisfiability of UML Class Diagrams with Constrained Class Hierarchy.

Autoren: BALABAN, MIRA MARAEE, AZZAM

Quelle: ACM Transactions on Software Engineering & Methodology; Jul2013, Vol. 22 Issue 3, p24:1-24:42, 42p

Schlagwörter: SOFTWARE engineering, SATISFIABILITY (Computer science), PROGRAMMING languages, UNIFIED modeling language, COMPUTER software development, ALGORITHMS, COMPUTER science

A LIST OF APPLICATIONS OF STALLINGS AUTOMATA.

Autoren: DELGADO, JORDI VENTURA, ENRIC

Quelle: Transactions on Combinatorics; 2022, Vol. 11 Issue 3, p181-235, 55p

Schlagwörter: FREE groups

Making Higher-Order Superposition Work.

Autoren: Vukmirović, Petar Bentkamp, Alexander Blanchette, Jasmin et al.

Quelle: Journal of Automated Reasoning; Nov2022, Vol. 66 Issue 4, p541-564, 24p

Schlagwörter: FIRST-order logic, LOGIC, CALCULI, INFERENCE (Logic)

Conditional Congruence Closure over Uninterpreted and Interpreted Symbols.

Autoren: Kapur, Deepak

Quelle: Journal of Systems Science & Complexity; Feb2019, Vol. 32 Issue 1, p317-355, 39p

ON THE TERMINATION OF RUSSELL’S DESCRIPTION ELIMINATION ALGORITHM.

Autoren: GRABMAYER, CLEMENS LEO, JOOP VAN OOSTROM, VINCENT et al.

Quelle: Review of Symbolic Logic; Sep2011, Vol. 4 Issue 3, p367-393, 27p, 3 Diagrams

Schlagwörter: DESCRIPTION (Philosophy), ELIMINATION (Mathematics), DESCRIPTION logics, SET theory, AMBIGUITY

Automating the Knuth Bendix ordering.

Autoren: Dick, Jeremy Kalmus, John Martin, Ursula

Quelle: Acta Informatica; 1990, Vol. 28 Issue 2, p95-119, 25p

Knuth–Bendix for Groups with Infinitely Many Rules.

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

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

Schlagwörter: GROUP schemes (Mathematics), FINITE groups

First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice.

Autoren: Burel, Guillaume Bury, Guillaume Cauderlier, Raphaël et al.

Quelle: Journal of Automated Reasoning; Aug2020, Vol. 64 Issue 6, p1001-1050, 50p

Schlagwörter: FIRST-order logic, REVISION (Writing process), AXIOMS, GENETIC polymorphisms, MATHEMATICS theorems

Tools and Algorithms for the Construction and Analysis of Systems : 31st International Conference, TACAS 2025, Held As Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, May 3–8, 2025, Proceedings, Part I

Autoren: Arie Gurfinkel Marijn Heule

Resource Type: eBook.

Schlagworte: System design--Congresses, Computer software--Verification--Congresses, System analysis--Congresses

Categories: COMPUTERS / Computer Science, COMPUTERS / Networking / General, COMPUTERS / Software Development & Engineering / General, COMPUTERS / Hardware / General, COMPUTERS / Computer Simulation

Implementing a fair monodic temporal logic prover.

Autoren: Ludwig, Michel Hustadt, Ullrich

Quelle: AI Communications; 2010, Vol. 23 Issue 2/3, p69-96, 28p, 5 Diagrams, 2 Charts

Schlagwörter: FIRST-order logic, CALCULUS, AUTOMATIC theorem proving, MATHEMATICAL logic, MATHEMATICAL analysis

Engineering DPLL(T) + Saturation.

Autoren: de Moura, Leonardo Bjørner, Nikolaj

Quelle: Automated Reasoning (9783540710691); 2008, p475-490, 16p