A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm

Journal of Computer and System Sciences - United States
doi 10.1016/0022-0000(81)90002-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Properties of the Nonsymmetric Robinson–Schensted–Knuth Algorithm

Journal of Algebraic Combinatorics
CombinatoricsDiscrete MathematicsNumber TheoryAlgebra
2012English

A Refinement-Based Correctness Proof of Symmetry Reduced Model Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Proof of Correctness for ASOCS AA3 Networks

IEEE Transactions on Systems, Man, and Cybernetics
1994English

Checking the Correctness of Architectural Transformation Steps via Proof-Carrying Architectures

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
1999English

Proof Automation for Functional Correctness in Separation Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2014English

Termination of SystemF-bounded: A Complete Proof

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1997English

Graph Decomposition Is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing
MathematicsComputer Science
1997English

Abstract Keyword Searching With Knuth Morris Pratt Algorithm

Scientific Journal of Informatics
2017English

General Correctness: A Unification of Partial and Total Correctness

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1985English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy