Sciweavers

190 search results - page 3 / 38
» Exponential Propagation for Set Variables
Sort
View
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 5 months ago
Reformulation of Global Constraints in Answer Set Programming
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
Christian Drescher, Toby Walsh
CP
2007
Springer
14 years 1 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
IJUFKS
2000
111views more  IJUFKS 2000»
13 years 6 months ago
A Factorized Representation of Independence of Causal Influence and Lazy Propagation
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...
Anders L. Madsen, Bruce D'Ambrosio
DATE
2003
IEEE
92views Hardware» more  DATE 2003»
14 years 4 days ago
Local Search for Boolean Relations on the Basis of Unit Propagation
We propose a method for local search of Boolean relations relating variables of a CNF formula. The method is to branch on small subsets of the set of CNF variables and to analyze ...
Yakov Novikov
JMLR
2010
137views more  JMLR 2010»
13 years 1 months ago
Importance Sampling for Continuous Time Bayesian Networks
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
Yu Fan, Jing Xu, Christian R. Shelton