Solving the Round Robin Problem Using Propositional Logic

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 262-266

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

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; ROUTERS;

CLASSICAL PROPOSITIONAL LOGIC; ENCODINGS; FEASIBLE SCHEDULE; HARD PROBLEMS; LOCAL SEARCH; PROPOSITIONAL LOGIC; ROUND ROBIN; SATISFIABILITY ALGORITHMS; SCHEDULING DOMAIN; SPORTS SCHEDULING;

FORMAL LOGIC;

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

References (17)

1. Bayardo, R. J., and Schrag, R. C. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence/RI, USA, 203-208.
2. Béjar, R., and Manyà, F. 1999a. A comparison of systematic and local search algorithms for regular CNF formulas. In Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU'99, London, England, 22-31. Springer LNAI 1638.
3. Béjar, R., and Manyà, F. 1999b. Phase transitions in the regular random 3-SAT problem. In Proceedings of the International Symposium on Methodologies for Intelligent Systems, ISMIS'99, Warsaw, Poland, 292-300. Springer LNAI 1609.
4. Béjar, R., and Manyà, F. 1999c. Solving combinatorial problems with regular local search algorithms. In Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, LPAR'99, Tbilisi, Republic of Georgia, 33-43. Springer LNAI 1705.
5. Crawford, J. M., and Baker, A. B. 1994. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'94, Seattle/WA, USA, 1092-1097.
6. Gomes, C. P.; Selman, B.; McAloon, K.; and Tretkoff, C. 1998. Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling, AIPS'98, Pittsburg/PA, USA.
7. Gomes, C. P.; Selman, B.; and Kautz, H. 1998. Boosting combinatorial search through randomization. In Proceedings of the 15th National Conference on Artificial Intelligence, AAAI'98, Madison/WI, USA, 431-437.
8. Hoos, H. H., and Stützle, T. 1998. Evaluating las Vegas algorithms - pitfalls and remedies. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, UAI'98, San Francisco/CA, USA, 238-245.
9. Hoos, H. H. 1999. On the run-time behaviour of stochastic local search algorithms for SAT. In Proceedings of the 16th National Conference on Artificial Intelligence, AAAI'99, 661-666.
10. Kautz, H. A., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'96, Portland/OR, USA, 1194-1201.
11. Kautz, H. A., and Selman, B. 1999. Unifying SAT-based and graph-based planning. In Proceedings of the International Joint Conference on Artificial Intelligence, IJ-CAI'99, Stockholm, Sweden, 318-325.
12. Li, C. M., and Anbulagan. 1997. Look-ahead versus look-back for satisfiability problems. In Proceedings of the 3rd International Conference on Principles of Constraint Programming, CP'97, Linz, Austria, 341-355. Springer LNCS 1330.
13. McAllester, D.; Selman, B.; and Kautz, H. 1997. Evidence for invariants in local search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence/RI, USA, 321-326.
14. McAloon, K.; Tretkoff, C.; and Wetzel, G. 1997. Sports league scheduling. In Proceedings of the 1997 ILOG Optimization Suite International Users' Conference, Paris, France.
15. Nemhauser, G. L., and Trick, M. A. 1998. Scheduling a major college basketball conference. Operations Research 46(1):1-8.
16. Selman, B.; Kautz, H. A.; and Cohen, B. 1994. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'94, Seattle/WA, USA, 337-343.
17. Warners, J. P., and van Maaren, H. 1999. A two phase algorithm for solving a class of hard satisfiability problems. Operations Research Letters 23(3-5):81-88.