Project: Please pick one of these papers for your presentation.
Ines Lynce, Luis Baptista, and Joao Marques-Silva, "Towards Provably Complete Stochastic Search Algorithms for Satisfiabilty".
[ ps | pdf ]
Joao P. Marques-Silva, "GRASP: A Search Algorithm for Propositional Satisfiability", IEEE Transactions On Computers, Vol. 48, NO. 5, MAY 1999
[ ps | pdf ]
Using Uncertainty within Computation, AAAI 2001 Fall Symposium.
Proceedings.
Using Uncertainty within Computation, AAAI 2001 Fall Symposium.
Provisional Schedule.
Chen, X. and van Beek, P., "Conflict-Directed Backjumping Revisited", (JAIR) Volume 14, pages 53-81.
[ ps | pdf ]
Roberto J. Bayardo Jr., Robert C. Schrag, "Using CSP Look-Back Techniques to Solve Real-World SAT Instances", Appears in Proc. of the 14th Nat’l Conf. on Artificial Intelligence, 203-208, 1997.
[ pdf ]
Roberto J. Bayardo Jr., Robert Schrag, "Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances", Appears in Proc. of the Second Int’l Conf. on Principles and Practice of Constraint Programming, 46-60, 1996.
[ pdf ]
Roberto J. Bayardo Jr., and Daniel P. Miranker, "A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem", Appeared in Proc. of the 13th Nat’l Conf. on Artificial Intelligence, 298-304, 1996.
[ pdf ]
Roberto J. Bayardo Jr. and Daniel P. Miranker, "On the Space-Time Trade-off in Solving Constraint Satisfaction Problems", Appeared in Proc. of the 14th Int’l Joint Conf. on Artificial Intelligence, 558-562, 1995.
[ pdf ]
I. Miguel, Q. Shen, "Solution Techniques for Constraint Satisfaction Problems:
Advanced Approaches", Artificial Intelligence Review vol. 15(4)
pp. 269-293, June 2001. Kluwer Academic Publishers.
[
pdf
]
C. Bessière and J.C. Régin, "Arc consistency for general constraint networks:
preliminary results", Proceedings IJCAI'97, Nagoya, Japan, pages 398-404.
[
pdf
]
C. Bessière and J.C. Régin, "MAC and combined heuristics: two reasons to
forsake FC (and CBJ?) on hard problems", Proceedings CP'96, Cambridge
MA, pages 61-75.
[
pdf
]
C. Bessière and P. Meseguer and E.C. Freuder and J. Larrosa, "On forward
checking for non-binary constraint satisfaction", Proceedings IJCAI'99
Workshop on Non-binary constraints, Stockholm, Sweden.
[
pdf
]
Cristian Coarfa, Demetrios D. Demopoulus, Alfonso San Miguel, Aguirre, Devika Subramanian, Moshe Y. Vardi, "Random 3-SAT: The Plot Thickens", 2001 Kluwer Academic Publishers..
[ pdf | ps ]
The following paper can be found in the course handout filing cabinet, located
on the 4th floor of the CS building, just outside of the copy center. Please make copies and leave the originals in the filing cabinet.
