- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
New local search methods for partial MaxSAT
Artificial Intelligence 240 (C):1-18 (2016)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Integrating multi-armed bandit with local search for MaxSAT.Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li & Felip Manyà - 2025 - Artificial Intelligence 338 (C):104242.
WPM3: An (in)complete algorithm for weighted partial MaxSAT.Carlos Ansótegui & Joel Gabàs - 2017 - Artificial Intelligence 250 (C):37-57.
CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability.Chuan Luo, Shaowei Cai, Kaile Su & Wenxuan Huang - 2017 - Artificial Intelligence 243 (C):26-44.
Partial order bounding: A new approach to evaluation in game tree search.Martin Müller - 2001 - Artificial Intelligence 129 (1-2):279-311.
SAT-based MaxSAT algorithms.Carlos Ansótegui, Maria Luisa Bonet & Jordi Levy - 2013 - Artificial Intelligence 196 (C):77-105.
MaxSAT by improved instance-specific algorithm configuration.Carlos Ansótegui, Joel Gabàs, Yuri Malitsky & Meinolf Sellmann - 2016 - Artificial Intelligence 235 (C):26-39.
Artificial intelligence and automatic programming in CAI.Elliot B. Koffman & Sumner-E. Blount - 1975 - Artificial Intelligence 6 (3):215-234.
Anytime heuristic search for partial satisfaction planning.J. Benton, Minh Do & Subbarao Kambhampati - 2009 - Artificial Intelligence 173 (5-6):562-592.
Local-MIP: Efficient local search for mixed integer programming.Peng Lin, Shaowei Cai, Mengchuan Zou & Jinkun Lin - 2025 - Artificial Intelligence 348 (C):104405.
Local search characteristics of incomplete SAT procedures.Dale Schuurmans & Finnegan Southey - 2001 - Artificial Intelligence 132 (2):121-150.
Analytics
Added to PP
2020-12-22
Downloads
42 (#1,334,813)
6 months
10 (#1,167,075)
2020-12-22
Downloads
42 (#1,334,813)
6 months
10 (#1,167,075)
Historical graph of downloads
Citations of this work
Integrating multi-armed bandit with local search for MaxSAT.Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li & Felip Manyà - 2025 - Artificial Intelligence 338 (C):104242.
Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability.Shaowei Cai & Zhendong Lei - 2020 - Artificial Intelligence 287 (C):103354.
WPM3: An (in)complete algorithm for weighted partial MaxSAT.Carlos Ansótegui & Joel Gabàs - 2017 - Artificial Intelligence 250 (C):37-57.
CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability.Chuan Luo, Shaowei Cai, Kaile Su & Wenxuan Huang - 2017 - Artificial Intelligence 243 (C):26-44.
References found in this work
SAT-based MaxSAT algorithms.Carlos Ansótegui, Maria Luisa Bonet & Jordi Levy - 2013 - Artificial Intelligence 196 (C):77-105.
Local search with edge weighting and configuration checking heuristics for minimum vertex cover.Shaowei Cai, Kaile Su & Abdul Sattar - 2011 - Artificial Intelligence 175 (9-10):1672-1696.
Local search for Boolean Satisfiability with configuration checking and subscore.Shaowei Cai & Kaile Su - 2013 - Artificial Intelligence 204 (C):75-98.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation