Result: Exploiting partial knowledge of satisfying assignments

Title:
Exploiting partial knowledge of satisfying assignments
Authors:
IWAMA, Kazuo, TAMAKI, Suguru
Source:
SAT 2001, the fourth international symposium on the theory and applications of satisfiability testingDiscrete applied mathematics. 155(12):1596-1603
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Algorithme recherche, Search algorithm, Algoritmo búsqueda, Assignation, Assignment, Asignación, Borne supérieure, Upper bound, Cota superior, Combinatoire, Combinatorics, Combinatoria, Connaissance, Knowledge, Conocimiento, Informatique théorique, Computer theory, Informática teórica, Optimisation, Optimization, Optimización, Problème NP complet, NP complete problem, Problema NP completo, Problème satisfiabilité, Satisfiability problem, Problema satisfactibilidad, Résultat expérimental, Experimental result, Resultado experimental, 68Wxx, Algorithme probabiliste, CNF, Problème SAT, SAT problem, Satisfiabilité, CNF satisfiability, NP-complete problem, Probabilistic algorithm
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Informatics, Kyoto University, Kyoto 606-8501, Japan
ISSN:
0166-218X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18962800
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.18962800
Database:
PASCAL Archive

Further Information

Recently Schoning has shown that a simple local-search algorithm for 3SAT achieves the currently best upper bound, i.e., an expected time of 1.334. In this paper, we show that this algorithm can be modified to run much faster if there is some kind of imbalance in satisfying assignments and we have a (partial) knowledge about that. Especially if a satisfying assignment has imbalanced 0's and 1's, i.e., pin 1's and (1 - p1)n 0's, then we can find a solution in time 1.260 when p1 = 1 3 and 1.072 when p1 =0.1. Such an imbalance often exists in SAT instances reduced from other problems. As a concrete example, we investigate a reduction from 3DM and show our new approach is nontrivially faster than its direct algorithms. Preliminary experimental results are also given.