Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,206,616 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.
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
Review
2014
Review
2014
A (Biased) Proof Complexity Survey for SAT Practitioners
Jakob Nordström
International Conference on Theory and…
2014
Corpus ID: 15619285
This talk is intended as a selective survey of proof complexity, focusing on some comparatively weak proof systems that are of…
Expand
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
2007
2007
IMPACT OF RESTRICTED BRANCHING ON CLAUSE LEARNING SAT SOLVING
Matti Järvisalo
2007
Corpus ID: 6012238
Propositional satisfiability (SAT) solving procedures (or SAT solvers) are used as efficient back-end search engines in solving…
Expand
2007
2007
Evolving a Neural Net-Based Decision and Search Heuristic for DPLL SAT Solvers
Raihan H. Kibria
International Joint Conference on Neural Networks
2007
Corpus ID: 16442133
Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT…
Expand