Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,422,856 papers from all fields of science
Search
Sign In
Create Free Account
Constraint learning
Known as:
Clause learning
, Relevance-bounded learning
In constraint satisfaction backtracking algorithms, constraint learning is a technique for improving efficiency. It works by recording new…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Algorithm
Backjumping
Backtracking
Constraint satisfaction problem
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Resolution and Clause-Learning with Restarts for Signed CNF Formulas.
D. Mitchell
2017
Corpus ID: 31326022
Motivated by the question of how to e � ciently do model finding or theorem proving for multi-valued logics, we study the relative…
Expand
2015
2015
Clause-Learning for Modular Systems
D. Mitchell
,
E. Ternovska
International Conference on Logic Programming and…
2015
Corpus ID: 2874047
We present an algorithm, CDCL-AMS, for solving Modular Systems consisting of a set of modules where, for each module, we have a…
Expand
2015
2015
Logic-based Methods for Reasoning About Search in Classical Planning
Salomé Simon
2015
Corpus ID: 6813115
I am currently roughly 9 months into my PhD studies, and the final topic of my PhD thesis is not yet fully settled. My current…
Expand
2014
2014
On conflict driven clause learning – a comparison between theory and practice
Gustav Sennton gsennton
2014
Corpus ID: 1778173
The boolean satisfiability (SAT) problem is the canonical NPcomplete problem and every other NP-complete problem can be reduced…
Expand
2014
2014
Lower bounds for width-restricted clause learning
Jan Johannsen
2014
Corpus ID: 183219435
2014
2014
Resolution and Clause Learning for Multi-Valued CNF Formulas
D. Mitchell
PRUV
2014
Corpus ID: 14912023
Conflict-directed clause learning (CDCL) is the basis of SAT solvers with impressive performance on many problems. CDCL with…
Expand
2012
2012
Concurrent Cube-and-Conquer ( Poster Presentation )
P. Tak
,
Marijn J. H. Heule
,
Armin Biere
2012
Corpus ID: 16186477
Satisfiability solvers targeting industrial instances are currently almost always based on conflict-driven clause learning (CDCL…
Expand
2010
2010
Learning from successes
Saïd Jabbour
Int. J. Artif. Intell. Tools
2010
Corpus ID: 1217862
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve…
Expand
2009
2009
Induction on Failure: Learning Connected Horn Theories
T. Kimber
,
K. Broda
,
A. Russo
International Conference on Logic Programming and…
2009
Corpus ID: 28533917
Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses…
Expand
2009
2009
Symbolic Techniques in Propositional Satisfiability Solving
Moshe Y. Vardi
International Conference on Theory and…
2009
Corpus ID: 21051253
Search-based techniques in propositional satisfiability (SAT) solving have been enormously successful, leading to what is…
Expand