Extended clause learning

DOI10.1016/j.artint.2010.07.008zbMath1210.68082OpenAlexW2158860049MaRDI QIDQ622116

Jinbo Huang

Publication date: 31 January 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.07.008

zbMATH Keywords

resolutionSATclause learningextended resolution

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Propositional SAT Solving ⋮ Simulating circuit-level simplifications on CNF ⋮ Propositional proof systems based on maximum satisfiability

Uses Software

• MiniSat
• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The intractability of resolution
• Some consequences of cryptographical conjectures for \(S_2^1\) and EF
• Resolution Is Not Automatizable Unless W[P Is Tractable]
• Extended Resolution Proofs for Conjoining BDDs
• Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
• The relative efficiency of propositional proof systems
• On Interpolation and Automatization for Frege Systems
• Theory and Applications of Satisfiability Testing
• Extended Resolution Proofs for Symbolic SAT Solving with Quantification

This page was built for publication: Extended clause learning