Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CORR
2006
Springer

favoriteEmaildiscussreport

112views Education» more CORR 2006»

Satisfying KBO Constraints

13 years 4 months ago

Satisfying KBO Constraints

Download cl-informatik.uibk.ac.at

Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for the precedence are encoded in (pseudo-)propositional logic and the resulting formula is tested for satisfiability. Any satisfying assignment represents a weight function and a precedence such that the induced Knuth-Bendix order orients the rules of the encoded rewrite system from left to right.

Harald Zankl, Aart Middeldorp

Real-time Traffic

CORR 2006 | Education | Knuth-Bendix Order | Satisfying Assignment | Weight Function |

claim paper

Related Content

» The Decidability of the FirstOrder Theory of KnuthBendix Order

» Constraints for Argument Filterings

» Incremental Satisfiability and Implication for UTVPI Constraints

» HeavyTailed Phenomena in Satisfiability and Constraint Satisfaction Problems

» A general information quality based approach for satisfying sensor constraints in multirob...

» INFORNA a server for fast inverse RNA folding satisfying sequence constraints

» Improving platformbased system synthesis by satisfiability modulo theories solving

» Testing Whether a Set of Code Words Satisfies a Given Set of Constraints

» Solving satisfiability problems with preferences

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Harald Zankl, Aart Middeldorp

Comments (0)