662 search results - page 48 / 133 » Logic Programming with Ordered Disjunction |
CORR
2004
Springer
13 years 8 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...
CAV
2010
Springer
14 years 21 days 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 ...
CLEF
2005
Springer
14 years 2 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...
IDA
2005
Springer
14 years 2 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...
JUCS
2006
13 years 8 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-...