Phase transitions in the regular random 3-SAT problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1609, Issue , 1999, Pages 292-300

  Béjar, Ramón ^a   Manyà, Felip ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

Benchmarks; Multiple valued logics; Phase transitions; Regular CNF formulas; Satisfiability; Threshold

Indexed keywords

BENCHMARKING; FORMAL LOGIC; INTELLIGENT SYSTEMS; PHASE TRANSITIONS;

3-SAT PROBLEMS; CARDINALITIES; CLASSICAL LOGIC; CNF FORMULAS; MULTIPLE VALUED LOGIC; SATISFIABILITY; THRESHOLD; TRUTH VALUES;

MANY VALUED LOGICS;

EID: 84957622939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0095115     Document Type: Conference Paper

References (9)

1. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'91, pages 331-337, 1991.
2. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5: 394-397, 1962.
3. R. Hähnle. Uniform notation of tableaux rules for multiple-valued logics. In Proc. International Symposium on Multiple-Valued Logic, Victoria, pages 238-245. IEEE Press, 1991.
4. R. Hähnle. Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, 4(6): 905-927, 1994.
5. R. Hähnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6: 49-69, 1996.
6. R. Hähnle. Personal communication, 1998.
7. L. M. Kirousis, E. Kranakis, and D. Krizanc. Aproximating the unsatisfiability threshold of random formulas. In Proc. 4th Annual European Symposium on Algorithms, ESA '96, pages 27-38, 1996.
8. F. Manyà, R. Béjar, and G. Escalada-Imaz. The satisfiability problem in regular CNF-formulas. Soft Computing: A Fusion of Foundations, Methodologies and Applications, 2(3): 116-123, 1998.
9. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the 10th National Conference on Artificial Intelligence AAAI'92, San Jose, CA, USA, pages 459-465, 1992.