Extended clause learning
type: Item
instance of: scholarly article
title: Extended clause learning
zbMATH Open document ID: 1210.68082
author: Jinbo Huang
published in: Artificial Intelligence
publication date: 2011-01-31T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5843088
zbMATH Keywords: SAT
zbMATH Keywords: clause learning
zbMATH Keywords: resolution
zbMATH Keywords: extended resolution
describes a project that uses: Chaff
describes a project that uses: MiniSat
MaRDI profile type: Publication
full work available at URL: j.artint.2010.07.008
OpenAlex ID: W2158860049
cites work: Q5715680
cites work: Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
cites work: The intractability of resolution
cites work: Q5593816
cites work: Q4152212
cites work: The relative efficiency of propositional proof systems
cites work: Theory and Applications of Satisfiability Testing
cites work: Extended Resolution Proofs for Conjoining BDDs
cites work: Extended Resolution Proofs for Symbolic SAT Solving with Quantification
cites work: Some consequences of cryptographical conjectures for \(S_2^1\) and EF
cites work: On Interpolation and Automatization for Frege Systems
cites work: Resolution Is Not Automatizable Unless W[P] Is Tractable
DOI: 10.1016/J.ARTINT.2010.07.008
description: scientific article; zbMATH DE number 5843088