4192 search results - page 428 / 839 » Probabilistic Logic Programming |
145
click to vote
RISE
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
146
click to vote
IJCAI
2001
15 years 6 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
121
click to vote
GPEM
2006
15 years 4 months ago
2006
This paper presents a Genetic Programming (GP) approach to the design of Mathematical Morphology (MM) algorithms for binary images. The algorithms are constructed using logic opera...
160
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
144
click to vote
BIRTHDAY
2000
Springer
15 years 9 months ago
2000
Springer
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...