A Rearrangement Search Strategy for Determining Propositional Satisfiability

Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988

Volumn , Issue , 1988, Pages 155-160

  Zabih, Ramin ^a   McAllester, David ^b  

^a STANFORD UNIVERSITY   (United States)

^b Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BOUND FUNCTION; CONJUNCTIVE NORMAL FORMS; PROPOSITIONAL FORMULAS; PROPOSITIONAL SATISFIABILITY; SATISFIABILITY; SEARCH STRATEGIES; SIMPLE ALGORITHM; SIMPLER ALGORITHMS; TRUTH ASSIGNMENT; UPPER BOUND;

FORMAL LOGIC;

EID: 84893675417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Bitner, J. and Reingold, E., "Backtrack programming techniques", Communications of the ACM IS (1975) 651-656.
2. Cook, S., "The complexity of theorem proving procedures," Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971).
3. Davis, M. and Putnam, H., "A computing procedure for quantification theory," Journal of the ACM 7 (1960), 201-215.
4. Haralick, R. and Elliot, G., "Increasing tree search efficiency for constraint satisfaction problems," Artificial Intelligence 14 (1980), 263-313.
5. Knuth, D., "Estimating the efficiency of backtrack programs," Mathematics of Computation 29 (1975), 121-136.
6. McAllester, D., "Ontic: a representation language for mathematics," MIT AI Lab Technical Report 979, July 1987. To be published by the MIT Press.
7. Montanari, U., "Networks of constraints: fundamental properties and applications to picture processing," Information Sciences 7 (1974) 95-132.
8. Purdom, P., Brown, C. and Robertson, E., "Backtracking with multi-level dynamic search rearrangement," Acta Informatica 15 (1981) 99-114.
9. Stone, H., and Stone, J., "Efficient search techniques - an empirical study of the N-queens problem," IBM Research Report RC 12057 (#54343), 1986.