BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
bendix (21)
order (11)
complet (7)
algorithm (4)
rewrit (3)

Stem knuth$ (all stems)

24 papers:

DocEngDocEng-2015-HassanH #automation #documentation #flexibility #layout
Knuth-Plass Revisited: Flexible Line-Breaking for Automatic Document Layout (TH, AH), pp. 17–20.
PPDPPPDP-2013-YamadaKS #order #polynomial #recursion
Unifying the Knuth-Bendix, recursive path and polynomial orders (AY, KK, TS), pp. 181–192.
RTARTA-2013-SternagelT #formal method #order
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion (CS, RT), pp. 287–302.
IJCARIJCAR-2012-SternagelZ #named #visualisation
KBCV — Knuth-Bendix Completion Visualizer (TS, HZ), pp. 530–536.
CADECADE-2011-KovacsMV #on the #order
On Transfinite Knuth-Bendix Orders (LK, GM, AV), pp. 384–399.
LATALATA-2009-LiefoogheTV #algorithm #self
Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching (AL, HT, JSV), pp. 481–492.
RTARTA-2006-WehrmanSW #named #termination
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker (IW, AS, EMW), pp. 287–296.
CADECADE-2005-ZhangSM #decidability #first-order
The Decidability of the First-Order Theory of Knuth-Bendix Order (TZ, HBS, ZM), pp. 131–148.
CADECADE-2003-KorovinV #order
An AC-Compatible Knuth-Bendix Order (KK, AV), pp. 47–59.
LICSLICS-2003-KorovinV #order
Orienting Equalities with the Knuth-Bendix Order (KK, AV), p. 75–?.
PEPMASIA-PEPM-2002-AgerDR #on the #partial evaluation #string
On obtaining Knuth, Morris, and Pratt’s string matcher by partial evaluation (MSA, OD, HKR), pp. 32–46.
ICALPICALP-2001-KorovinV #constraints #theorem proving
Knuth-Bendix Constraint Solving Is NP-Complete (KK, AV), pp. 979–992.
RTARTA-2001-KorovinV #order #using #verification
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order (KK, AV), pp. 137–153.
LICSLICS-2000-KorovinV #algebra
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering (KK, AV), pp. 291–302.
RTARTA-1991-Bundgen #algorithm #simulation
Simulation Buchberger’s Algorithm by Knuth-Bendix Completion (RB), pp. 386–397.
ICALPICALP-1990-Klop #term rewriting
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond (JWK), pp. 350–369.
PPDPALP-1990-Steinbach #term rewriting
AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering (JS), pp. 372–386.
ICALPICALP-1989-LouchardRS #algorithm #analysis #probability
Dynamic Algorithms in D. E. Knuth’s Model: A Probabilistic Analysis (GL, BR, RS), pp. 521–533.
RTARTA-1989-Christian #performance #summary
Fast Knuth-Bendix Completion: Summary (JC), pp. 551–555.
ICALPICALP-1987-Diekert #concurrent #on the #process
On the Knuth-Bendix Completion for Concurrent Processes (VD), pp. 42–53.
RTARTA-1987-Martin #how
How to Choose Weights in the Knuth Bendix Ordering (UM), pp. 42–53.
ICALPICALP-1986-HermannP #algorithm #on the
On Nontermination of Knuth-Bendix Algorithm (MH, IP), pp. 146–156.
CADECADE-1986-Plaisted
A Simple Non-Termination Test for the Knuth-Bendix Method (DAP), pp. 79–88.
CADECADE-1984-Stickel #case study #commutative #proving #theorem proving
A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity (MES), pp. 248–258.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.