Complexity of planning in action formalisms based on description logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4790 LNAI, Issue , 2007, Pages 408-422

  Miličić, Maja ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; LOGIC PROGRAMMING; PROBLEM SOLVING;

DESCRIPTION LOGICS; INTEGRATING ACTION FORMALISMS;

COMPUTATIONAL COMPLEXITY;

EID: 38149066682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
2. Baader, F., Lutz, C., Milicic, M., Sattler, U., Wolter, F.: Integrating description logics and action formalisms: First results. In: Proceedings of AAAI 2005, Pittsburgh, PA, USA (2005)
3. Baader, F., Lutz, C., Milicic, M., Sattler, U., Wolter, F.: Integrating description logics and action formalisms for reasoning about web services. Technical Report LTCS 05-02, TU Dresden (2005), See http://lat.inf.tu-dresden. de/research/reports.html
4. Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(1-2), 165-204 (1994)
5. Castellini, C., Giunchiglia, E., Tacchella, A.: Sat-based planning in complex domains: Concurrency, constraints and nondeterminism. Artif. Intell. 147(1-2), 85-117 (2003)
6. Erol, K., Nau, D.S., Subrahmanian, V.S.: Complexity, decidability and undecidability results for domain-independent planning: A detailed analysis. Technical Report CS-TR-2797, University of Maryland College Park (1991)
7. Erol, K., Nau, D.S., Subrahmanian, V.S.: Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence 76(1-2), 75-88 (1995)
8. Haslum, P., Jonsson, P.: Some results on the complexity of planning with incomplete information. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol. 1809, pp. 308-318. Springer, Heidelberg (2000)
9. Horrocks, I., Patel-Schneider, P.F., van Harrnelen, F.: From SHIQ and RDF to OWL: The making of a web ontology language. Journal of Web Semantics 1(1), 7-26 (2003)
10. Liu, H., Lutz, C., Milicic, M., Wolter, F.: Reasoning about actions using description logics with general TBoxes. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006, LNCS (LNAI), vol. 4160, pp. 266-279. Springer, Heidelberg (2006)
11. Liu, H., Lutz, C., Milicic, M., Wolter, F.: Updating description logic ABoxes. In: Proceedings of KR 2006, pp. 46-56 (2006)
12. Nebel, B.: Terminological reasoning is inherently intractable. Artificial Intelligence 43, 235-249 (1990)
13. Palacios, H., Gcffner, H.: Compiling uncertainty away: Solving conformant planning problems using a classical planner (sometimes). In: Proc. of AAAI 2006 (2006)
14. Reiter, R.: Knowledge in Action. MIT Press, Cambridge (2001)
15. Rintanen, J.: Complexity of planning with partial observability. In: Proceedings of (ICAPS 2004), pp. 345-354 (2004)
16. Savitch, W.J.: Relationship between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4, 177-192 (1970)
17. Thielscher, M.: Introduction to the Fluent Calculus. Electronic Transactions on Artificial Intelligence 2(3-4), 179-192 (1998)