1252 search results - page 11 / 251 » Minimizing Learned Clauses |
CADE
2009
Springer
16 years 13 days ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
120
click to vote
ECML
1998
Springer
15 years 3 months ago
1998
Springer
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
ICTAI
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses...
DAC
2005
ACM
15 years 1 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
109
click to vote
TABLEAUX
1999
Springer
15 years 4 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...