379 search results - page 36 / 76 » Probabilistic (logic) programming concepts |
191
click to vote
ALP
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
122
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
The actions of a robot like lifting an object are often best thought of as low-level processes with uncertain outcome. A highlevel robot plan can be seen as a description of a task...
158
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
137
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
165
click to vote
DALT
2005
Springer
15 years 10 months ago
2005
Springer
Developing applications that make effective use of machine-readable knowledge sources as promised by the Semantic Web vision is attracting much of current research interest; this v...