Sciweavers

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

26

RTA
2011
Springer

favoriteEmaildiscussreport

207views Theoretical Computer Science» more RTA 2011»

Maximal Completion

12 years 7 months ago

Maximal Completion

Download www.jaist.ac.jp

Given an equational system, completion procedures compute an equivalent and complete (terminating and conﬂuent) term rewrite system. We present a very simple and eﬃcient completion procedure, which is based on MaxSAT solving. Experiments show that the procedure is comparable to recent powerful completion tools. 1998 ACM Subject Classiﬁcation F.4.2 Grammars and Other Rewriting Systems Keywords and phrases Term Rewriting, Knuth-Bendix Completion, Multi-completion Digital Object Identiﬁer 10.4230/LIPIcs.xxx.yyy.p Category System Description

Dominik Klein, Nao Hirokawa

Real-time Traffic

Completion Procedures | Rewrite System | Rewriting Systems | RTA 2011 | Theoretical Computer Science |

claim paper

Related Content

» A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns

» OnLine Scheduling to Maximize Task Completions

» Maximizing Job Completions Online

» REPuter fast computation of maximal repeats in complete genomes

» P Systems Petri Nets and Program Machines

» An Online Algorithm for Maximizing Submodular Functions

» Towards a Complete Classification of Tractability in Allens Algebra

» Deterministic Polynomial Time Algorithms for Matrix Completion Problems

» Complete Strategies for Term Graph Narrowing

Post Info
More Details (n/a)

Added	17 Sep 2011
Updated	17 Sep 2011
Type	Journal
Year	2011
Where	RTA
Authors	Dominik Klein, Nao Hirokawa

Comments (0)