Sciweavers

121 search results - page 19 / 25
» The complexity of temporal logic over the reals
Sort
View
ICALP
2009
Springer
15 years 12 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
CI
2000
114views more  CI 2000»
14 years 11 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
IUI
2009
ACM
15 years 4 months ago
Automatic design of a control interface for a synthetic face
Getting synthetic faces to display natural facial expressions is essential to enhance the interaction between human users and virtual characters. Yet traditional facial control te...
Nicolas Stoiber, Renaud Séguier, Gaspard Br...
111
Voted
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
15 years 3 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
100
Voted
EUROCAST
2003
Springer
130views Hardware» more  EUROCAST 2003»
15 years 4 months ago
A Model of Neural Inspiration for Local Accumulative Computation
This paper explores the computational capacity of a novel local computational model that expands the conventional analogical and logical dynamic neural models, based on the charge ...
José Mira, Miguel Angel Fernández, M...