SAT-based procedures for temporal reasoning

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 97-108

  Armando, Alessandro ^a,b   Castellini, Claudio ^c   Giunchiglia, Enrico ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b LORIA   (France)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

CONSISTENCY CHECKS; CONSISTENCY PROBLEMS; DISJUNCTIVE CONSTRAINTS; EXPERIMENTAL ANALYSIS; ORDERS OF MAGNITUDE; SAT-BASED; TEMPORAL CONSTRAINTS; TEMPORAL REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 84943248441     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_8     Document Type: Conference Paper

References (17)

1. J.Allen, H.Kautz, and R.Pelavin (Eds.).Reasoning about Plans.Morgan Kaufmann, 1991.
2. V.Brusoni, L.Console, B.Pernici, and P.Terenziani.LaTeR: An ecient, General Purpose Manager of Temporal Information.IEEE Software, 1996.
3. M.Buro and H.Buning.Report on a SAT competition.Technical Report 110, University of Paderborn, Germany, November 1992.
4. Cheng-Chung Cheng and Stephen F.Smith.Generating feasible schedules under complex metric constraints.In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), volume 2, pages 1086-1091, Seattle, Washington, USA, August 1994.AAAI Press/MIT Press.
5. N.Chleq.ecient algorithms for networks of quantitative temporal constraints.In Proceedings of CONSTRAINTS95, pages 40-45, April 1995.
6. M.D'Agostino.Are Tableaux an Improvement on Truth-Tables? Journal of Logic, Language and Information, 1:235-252, 1992.
7. M.Davis and H.Putnam.A computing procedure for quanti -cation theory.Journal of the ACM, 7:201-215, 1960.
8. R.Dechter, I.Meiri, and J.Pearl.Temporal constraint networks.Artificial Intelligence, 49(1-3):61-95, January 1991.
9. Jon W.Freeman.Improvements to propositional satisfiability search algorithms.PhD thesis, University of Pennsylvania, 1995.
10. F.Giunchiglia and R.Sebastiani.Building decision procedures for modal logics from propositional decision procedures-the case study of modal K.In Proc.CADE-96, Lecture Notes in Artificial Intelligence, New Brunswick, NJ, USA, August 1996.Springer Verlag.
11. E.Giunchiglia, F.Giunchiglia, and A.Tacchella.SATBased Decision Procedures for Classical Modal Logics, 2000.Accepted for publication in Journal of Automated Reasoning.Available at http://www.mrg.dist.unige.it/enrico.
12. R.M.Haralick and G.L.Elliott.Increasing Tree Search eciency for Constraint Satisfaction Problems.Acta Informatica, 14:263-313, 1980.
13. Peter Jonsson and Christer Bäckström.A linearprogramming approach to temporal reasoning.In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 1235-1241, Menlo Park, August 4-8 1996.AAAI Press / MIT Press.
14. Manolis Koubarakis.The complexity of query evaluation in inde-nite temporal constraint databases.Theoretical Computer Science, 171(1-2):25-60, 15 January 1997.
15. Patrick Prosser.Hybrid algorithms for the constraint satisfaction problem.Computational Intelligence, 9(3):268-299, 1993.
16. R.M.Smullyan.First-Order Logic.Springer-Verlag, NY, 1968.
17. Kostas Stergiou and Manolis Koubarakis.Backtracking algorithms for disjunctions of temporal constraints.In Proc.AAAI, 1998.