4192 search results - page 319 / 839 » Probabilistic Logic Programming |
162
click to vote
AAAI
1998
15 years 7 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
179
Voted
JAIR
2007
15 years 6 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
229
click to vote
ICSOC
2010
Springer
15 years 4 months ago
2010
Springer
Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of ser...
176
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
169
Voted
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...