Sciweavers

238 search results - page 31 / 48
» Planning as Satisfiability
Sort
View
AAMAS
2008
Springer
13 years 11 months ago
DARE: a system for distributed abductive reasoning
Abductive reasoning is a well established field of Artificial Intelligence widely applied to different problem domains not least cognitive robotics and planning. It has been used ...
Jiefei Ma, Alessandra Russo, Krysia Broda, Keith C...
CASCON
2010
225views Education» more  CASCON 2010»
13 years 7 months ago
Monitoring and Recovery of Web Service Applications
For a system of distributed processes, correctness can be ensured by (statically) checking whether their composition satisfies properties of interest. However, web services are dis...
Jocelyn Simmonds, Shoham Ben-David, Marsha Chechik

Book
357views
15 years 9 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
CSE
2009
IEEE
14 years 5 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
WECWIS
2009
IEEE
162views ECommerce» more  WECWIS 2009»
14 years 5 months ago
QoS-Driven Web Service Composition Using Learning-Based Depth First Search
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
Wonhong Nam, Hyunyoung Kil, Jungjae Lee