Local search for Boolean Satisfiability with configuration checking and subscore

&
Artificial Intelligence 204 (C):75-98 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2013.09.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,440

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

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.
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.
Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories.Clark Wayne Barrett - 2003 - Dissertation, Stanford University
PDL with intersection and converse: satisfiability and infinite-state model checking.Stefan Göller, Markus Lohrey & Carsten Lutz - 2009 - Journal of Symbolic Logic 74 (1):279-314.
MAX-SAT Problem using Hybrid Harmony Search Algorithm.Iyad Abu Doush, Amal Lutfi Quran, Mohammed Azmi Al-Betar & Mohammed A. Awadallah - 2018 - Journal of Intelligent Systems 27 (4):643-658.
Drawing Interactive Euler Diagrams from Region Connection Calculus Specifications.François Schwarzentruber - 2015 - Journal of Logic, Language and Information 24 (4):375-408.
The complexity of hybrid logics over equivalence relations.Martin Mundhenk & Thomas Schneider - 2009 - Journal of Logic, Language and Information 18 (4):493-514.
Boolean products of R0-algebras.Xiangnan Zhou & Qingguo Li - 2010 - Mathematical Logic Quarterly 56 (3):289-298.
Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
Satisfiability Testing for Boolean Formulas Using Δ-Trees.G. Gutiérrez, I. P. De Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
New local search methods for partial MaxSAT.Shaowei Cai, Chuan Luo, Jinkun Lin & Kaile Su - 2016 - Artificial Intelligence 240 (C):1-18.
Week 1: Propositional Logic, or Boolean Logic.Jan van Eijck - unknown
Model checking for hybrid logic.Martin Lange - 2009 - Journal of Logic, Language and Information 18 (4):465-491.
Theory and applications of satisfiability testing: 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004: revised selected papers.Holger H. Hoos & David G. Mitchell (eds.) - 2005 - New York: Springer.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,296,210)

6 months
5 (#633,186)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Add more references