846 search results - page 89 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
90
Voted
EUROPAR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
113
click to vote
MFCS
2001
Springer
15 years 5 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
77
Voted
DELTA
2004
IEEE
15 years 4 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
81
Voted
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual...
90
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...