662 search results - page 48 / 133 » Logic Programming with Ordered Disjunction |
169
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
142
click to vote
CAV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
164
click to vote
CLEF
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
215
click to vote
IDA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
169
click to vote
JUCS
2006
15 years 6 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...