Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,397
Finite Domain Constraint Solver Learning
"... In this paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. The behavior of the consistency to be learned is taken as the set of examples on which the learning process is applied. The best possible expression o ..."
Abstract
- Add to MetaCart
In this paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. The behavior of the consistency to be learned is taken as the set of examples on which the learning process is applied. The best possible expression
An Open-Ended Finite Domain Constraint Solver
, 1997
"... We describe the design and implementation of a finite domain constraint solver embedded in a Prolog system using an extended unification mechanism via attributed variables as a generic constraint interface. The solver is essentially a scheduler for indexicals, i.e. reactive functional rules encodin ..."
Abstract
-
Cited by 194 (8 self)
- Add to MetaCart
We describe the design and implementation of a finite domain constraint solver embedded in a Prolog system using an extended unification mechanism via attributed variables as a generic constraint interface. The solver is essentially a scheduler for indexicals, i.e. reactive functional rules
Implementing a finite domain constraint solver for SICStus Prolog
, 1995
"... This report describes the design and implementation of a finite domain constraint solver for SICStus Prolog. Most programming languages used by the industry and most people outside of the academic world, such as C, C++ and FORTRAN are imperative languages. In an imperative language the programmer d ..."
Abstract
- Add to MetaCart
This report describes the design and implementation of a finite domain constraint solver for SICStus Prolog. Most programming languages used by the industry and most people outside of the academic world, such as C, C++ and FORTRAN are imperative languages. In an imperative language the programmer
A hybrid BDD and SAT finite domain constraint solver
- IN: PROCEEDINGS OF PADL.
, 2006
"... Finite-domain constraint solvers based on Binary Decision Diagrams (BDDs) are a powerful technique for solving constraint problems over finite set and integer variables represented as Boolean formulæ. Boolean Satisfiability (SAT) solvers are another form of constraint solver that operate on constrai ..."
Abstract
-
Cited by 15 (5 self)
- Add to MetaCart
Finite-domain constraint solvers based on Binary Decision Diagrams (BDDs) are a powerful technique for solving constraint problems over finite set and integer variables represented as Boolean formulæ. Boolean Satisfiability (SAT) solvers are another form of constraint solver that operate
14.1 An Efficient Finite-Domain Constraint Solver for Circuits
"... This paper presents a novel hybrid finite-domain constraint solving engine for RTL circuits. We describe how DPLL search is modified for search in combined integer and Boolean domains by using efficient finite-domain constraint propagation. This enables efficient combination of Boolean SAT and linea ..."
Abstract
- Add to MetaCart
This paper presents a novel hybrid finite-domain constraint solving engine for RTL circuits. We describe how DPLL search is modified for search in combined integer and Boolean domains by using efficient finite-domain constraint propagation. This enables efficient combination of Boolean SAT
A Field Programmable Gate Array Based Finite-Domain Constraint Solver
, 2008
"... All Rights Reservediii ..."
Chaff: Engineering an Efficient SAT Solver
, 2001
"... Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well ..."
Abstract
-
Cited by 1350 (18 self)
- Add to MetaCart
as in Artificial Intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm
Sparse MRI: The Application of Compressed Sensing for Rapid MR Imaging
- MAGNETIC RESONANCE IN MEDICINE 58:1182–1195
, 2007
"... The sparsity which is implicit in MR images is exploited to significantly undersample k-space. Some MR images such as angiograms are already sparse in the pixel representation; other, more complicated images have a sparse representation in some transform domain–for example, in terms of spatial finit ..."
Abstract
-
Cited by 538 (11 self)
- Add to MetaCart
The sparsity which is implicit in MR images is exploited to significantly undersample k-space. Some MR images such as angiograms are already sparse in the pixel representation; other, more complicated images have a sparse representation in some transform domain–for example, in terms of spatial
Control of Systems Integrating Logic, Dynamics, and Constraints
- Automatica
, 1998
"... This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real and ..."
Abstract
-
Cited by 413 (50 self)
- Add to MetaCart
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real
Results 1 - 10
of
2,397
