Sciweavers

2084 search results - page 105 / 417
» Set Constraints in Logic Programming
Sort
View
ISSTA
2004
ACM
14 years 1 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
PPDP
2001
Springer
14 years 17 days ago
When Do Bounds and Domain Propagation Lead to the Same Search Space?
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
Christian Schulte, Peter J. Stuckey
ENTCS
2008
136views more  ENTCS 2008»
13 years 8 months ago
Multimodal Separation Logic for Reasoning About Operational Semantics
We show how to reason, in the proof assistant Coq, about realistic programming languages using a combination of separation logic and heterogeneous multimodal logic. A heterogeneou...
Robert Dockins, Andrew W. Appel, Aquinas Hobor
COR
2006
98views more  COR 2006»
13 years 8 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
JMLR
2012
11 years 10 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