166 search results - page 16 / 34 » Event Spaces and their Linear Logic |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
117
click to vote
IWFM
2003
14 years 10 months ago
2003
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
CAV
1998
Springer
15 years 1 months ago
1998
Springer
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
106
click to vote
LPAR
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
ECCC
2010
14 years 8 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...