On the power of clause-learning SAT solvers as resolution engines

&
Artificial Intelligence 175 (2):512-525 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2010.10.002

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,174

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Clause vivification by unit propagation in CDCL SAT solvers.Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü & Yu Li - 2020 - Artificial Intelligence 279 (C):103197.
Understanding the power of Max-SAT resolution through UP-resilience.Mohamed Sami Cherif, Djamal Habet & André Abramé - 2020 - Artificial Intelligence 289 (C):103397.
ASSAT: computing answer sets of a logic program by SAT solvers.Fangzhen Lin & Yuting Zhao - 2004 - Artificial Intelligence 157 (1-2):115-137.
SATenstein: Automatically building local search SAT solvers from components.Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos & Kevin Leyton-Brown - 2016 - Artificial Intelligence 232 (C):20-42.
Resolution for Max-SAT.María Luisa Bonet, Jordi Levy & Felip Manyà - 2007 - Artificial Intelligence 171 (8-9):606-618.
Clause trees: a tool for understanding and implementing resolution in automated reasoning.J. D. Horton & Bruce Spencer - 1997 - Artificial Intelligence 92 (1-2):25-89.
Extended clause learning.Jinbo Huang - 2010 - Artificial Intelligence 174 (15):1277-1284.
Learning MAX-SAT from contextual examples for combinatorial optimisation.Mohit Kumar, Samuel Kolb, Stefano Teso & Luc De Raedt - 2023 - Artificial Intelligence 314 (C):103794.
Learning action models from plan examples using weighted MAX-SAT.Qiang Yang, Kangheng Wu & Yunfei Jiang - 2007 - Artificial Intelligence 171 (2-3):107-143.
Theory and applications of satisfiability testing - SAT 2009: 12th international conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009: proceedings.Oliver Kullmann (ed.) - 2009 - Berlin: Springer.

Analytics

Added to PP
2020-12-22

Downloads
16 (#1,194,266)

6 months
3 (#1,473,720)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Polynomial calculus for optimization.Ilario Bonacina, Maria Luisa Bonet & Jordi Levy - 2024 - Artificial Intelligence 337 (C):104208.

View all 6 citations / Add more citations

References found in this work

Add more references