328 search results - page 14 / 66 » Simple Termination Revisited |
ACL
2006
13 years 9 months ago
2006
We revisit the idea of history-based parsing, and present a history-based parsing framework that strives to be simple, general, and flexible. We also provide a decoder for this pr...
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
TELSYS
1998
13 years 7 months ago
1998
The Multimedia Internet Terminal (MINT)1 is a flexible multimedia tool set that allows the establishment and control of multimedia sessions across the Internet. The system archit...
SAS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...