Sciweavers

54 search results - page 2 / 11
» Non-termination Inference for Constraint Logic Programs
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 10 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
14 years 4 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
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...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
ICLP
2010
Springer
14 years 2 months ago
Abductive Inference in Probabilistic Logic Programs
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...
Gerardo I. Simari, V. S. Subrahmanian
ICFP
2008
ACM
14 years 10 months ago
From ML to MLF: graphic type constraints with efficient type inference
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 ...
Boris Yakobowski, Didier Rémy
JMLR
2012
12 years 1 months ago
Markov Logic Mixtures of Gaussian Processes: Towards Machines Reading Regression Data
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...
Martin Schiegg, Marion Neumann, Kristian Kersting