Sciweavers

1614 search results - page 212 / 323
» Planning as Temporal Reasoning
Sort
View
TIME
2009
IEEE
16 years 1 months ago
Model Checking CTL is Almost Always Inherently Sequential
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
TIME
2006
IEEE
16 years 13 days ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov
WWW
2006
ACM
16 years 11 days ago
ASDL: a wide spectrum language for designing web services
A Service oriented system emerges from composition of services. Dynamically composed reactive Web services form a special class of service oriented system, where the delays associ...
Monika Solanki, Antonio Cau, Hussein Zedan
ICLP
1997
Springer
15 years 10 months ago
The Complexity of Model Checking in Modal Event Calculi
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 propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
DAGSTUHL
2006
15 years 7 months ago
On Scene Interpretation with Description Logics
We examine the possible use of Description Logics as a knowledge representation and reasoning system for high-level scene interpretation. It is shown that aggregates composed of m...
Bernd Neumann, Ralf Möller