54 search results - page 2 / 11 » Non-termination Inference for Constraint Logic Programs |
INFORMS
1998
13 years 4 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
SAS
2005
Springer
13 years 10 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
ICLP
2010
Springer
13 years 9 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
ICFP
2008
ACM
14 years 5 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
JMLR
2012
11 years 7 months ago
2012
We propose a novel mixtures of Gaussian processes model in which the gating function is interconnected with a probabilistic logical model, in our case Markov logic networks. In th...