A Planner Fully Based on Linear Time Logic

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 347-354

  Mayer, M Cialdea ^a   Orlandiui, A ^a   Balestreri, G ^a   Limongelli, C ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DOMAIN KNOWLEDGE;

DOMAIN KNOWLEDGE; ENCODINGS; LINEAR TIME LOGIC; PLANNING DOMAINS; PLANNING LANGUAGES; PLANNING SYSTEMS; PROBLEM INSTANCES; SEARCH SPACES; SPECIFIC INFORMATION; SYSTEM PLANNING;

PROBLEM SOLVING;

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

References (20)

1. Bacchus, F ., and Kabanza, F. 1995. Using temporal logic to control search in a forward chaining planner. In Proc. of the TIME-95 International Workshop on Temporal Representation and Reasoning.
2. Bacchus, F ., and Kabanisa, F. 1996. Planning for temporally extended goals. In Prvceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1215-1222. A A A I Press / The M I T Press.
3. Barringcr, H.; Fisher, M.; Gabbay, D.; and Hunter, A. 1991. Meta-reasoning in executable temporal logic. In Proc. of the Second Int. Conf. on Principles of Knowledge Representation and Reasoning.
4. C(?rrito, S., and Cialdoa Mayer, M. 1998. Using linear temporal logic to model and solve planning problems. In Ghmghiglia, F ., ed., Proceedings of the 8th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA'98), 141-152. Springer.
5. Costa, A., and Oddi, A. 1996. D D L . l: a formal description of a constraint reprosentaton language for physical domains. In Ghallab, M., and Milaiii, A., ods., New Dii-ection in AI Planning, 341-352. IOS Press.
6. Cimatti, .A., and Roveri, M. 1999. Conformant planning via model cJiecking. In Proc. of the Fifth European Conference on Planning (ECP-99).
7. Cimatti, A.; Giunchiglia, E .; Giunchiglia, F .; and Traverso, P. 1997. Planning via model checking: a decision procedure for Ali- In Steel, S., and Alami, R., cds., Proc. of the Fourth European Conference on Planning (ECP-97), 130-142. Springer-Verlag.
8. Curric, K., and Tate, A. 1991. 0-Plan: the open planning architecture. Journal of Artificial Intelligence 52:49-86.
9. Erol, K.; Kendler, J .; and Nau, D.S. 1994. Complexity results for HTN planning. In Pivceedings of AAAI-94. Janssen, G. L. J. M. 1999. Logics for Digital Circuit Verification. Theory, Algorithms and Applications. CIP-DATA Library Technische Universitcit Eindhoven.
10. Kautz, H., and Sehnan, B. 1992. Planning as satisñability. In Neumann, B., ed., ÍOth European Conference on Artificial Intelligence (ECAIJ, 360-363. Wiley & Sons.
11. Kautz, H., and Selman, B. 1998a. B L A C K B O X: A new approach to the application of theorem proving to problem solving. In Working notes of the AIPS-98 Workshop on Planning as Combinatorial Search, 58-60.
12. Kautz, H., and Selman, B. 1998b. The role of domain-specific knowledge in the planning as satisfiaty femework. In Proc. of the Fourth Int. Conf on Artificial Intelligence Planning Systems (AIPS-98).
13. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding plans in propositional logic. In Proc. of the 5th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'96), 374-384.
14. Koehlor, J ., and Treinen, R. 1995. Constraint deduction in an interval-based temporal logic. In Fisher, M., and Owens, R., eds., Executable Modal and Temporal Logics, (Proc. of the I.ICAr93 Workshop), volume 897 of LNAI, 103 117. Springer.
15. Koehler, J .; Nebel, B.; Hoffmann, J .; and Dimopoulos, Y. 1997. Extending planning graphs to an ADL subset. In Steel, S., and Alami, R., eds., Proc. of the Fourth European Conference on Planning (ECP-97), 273-285. Springer-Verlag.
16. Leroy, X. 1999. The Objective Caml system, documentation and user's guide, release 2.02. .available at http: / / c a m l . i n r i a . tri.
17. Long, D., and Fox. M. 1998. Type analysis of planning domain descriptions. In 17th Workshop of UK Planning and Scheduling.
18. Reiter, R. 1991. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness roa\ilt for goal regression. In Lifschitz, v., ed.. Artificial Intelligence and mathematical theory of computation: Papers in honor of John McCarthy. Academic Press. 359 380.
19. Stephan, B., and Biundo, S. 1996. Deduction based refinement planning. In Drabble, B., cd., Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), 213-220. AAAI Press.
20. Yang, Q. 1990. Formalizing planning knowledge for hierardiical planning. Computational Intelligence 10:l2 24.