Sciweavers

1614 search results - page 200 / 323
» Planning as Temporal Reasoning
Sort
View
ICLP
2003
Springer
15 years 11 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
FTDCS
2004
IEEE
15 years 10 months ago
Introducing Compositionality in Web Service Descriptions
Web services are essentially black box components from a composer's or a mediator's perspective. The behavioural description of any service can be asserted by the compos...
Monika Solanki, Antonio Cau, Hussein Zedan
AIML
2006
15 years 7 months ago
Dynamic topological logics over spaces with continuous functions
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
Boris Konev, Roman Kontchakov, Frank Wolter, Micha...
ATAL
2010
Springer
15 years 7 months ago
The multi variable multi constrained distributed constraint optimization framework
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
Christopher Portway, Edmund H. Durfee
TOPNOC
2008
15 years 6 months ago
TAPAs: A Tool for the Analysis of Process Algebras
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
Francesco Calzolai, Rocco De Nicola, Michele Loret...