1204 search results - page 6 / 241 » Termination of Polynomial Programs |
ENTCS
2008
13 years 7 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
CDB
1997
Springer
13 years 11 months ago
1997
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
SAS
2001
Springer
13 years 12 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
ALT
2003
Springer
14 years 4 months ago
2003
Springer
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...