Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Knowledge in Action Seminar Topics for Short Talks Summer 2007 Topics References 1 (1) STRIPS & PDDL 09.05.07 - Marian [FN71, McD98, FL03] 2 (2) SatPlan & Blackbox 16.05.07 - Martin, Peter [KS92, KS96, KMS96, KS99] 3a (2) Planning as Satisfiability and QBF [RHN05, Rin04a, Rin04b] [Rin03, EMW97, Rin99] 23.05.07 - Roland, Kristine 3b (2) Planning with QBF [RHN05, Rin04a, Rin04b] [Rin03, EMW97, Rin99] 30.05.07 Saskia, Friederike 4 (2) Action Languages 06.06.07 - Falko, Nikolas [GL98] 5 (2) CCalc 13.06.07 - Robert, Andrea [MT98, MT97, GLL+ 04] 6 (1) C+ and MAD 20.06.07 - Oliver [LL03, LR06] 7 (2) ASP Encoding of Action Languages 27.06.07 - Mario, Andrej [LT99, Lif02, GL93] 8 (2) ASP Planning: dlv K 04.07.07 - Jens, Christian A. [EFL+ 00, EFL+ 03] 9 (1) Preferences in Action Languages 11.07.07 - Ajybek [SP04a, BM05b, BM05a, SP04b] 10 (3) Applications in Bioinformatics 18.07.07 - Torsten, Christian D., Max [BCT+ 04, GSS06, TBNJ05] References [BCT+ 04] Chitta Baral, Karen Chancellor, Nam Tran, Nhan Tran, A. Joy, and M. Berens. A knowledge based approach for representing and reasoning about signaling networks. In ISMB/ECCB (Supplement of Bioinformatics), pages 15–22, 2004. 2 [BM05a] M. Bienvenu and S. McIlraith. Qualitative dynamical preferences in the situation calculus. In Proceedings of the IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling, 2005. 2 [BM05b] M. Bienvenu and S. McIlraith. Specifying and generating preferred plans. In Working Notes of the Seventh International Symposium on Logical Formalizations of Commonsense Reasoning, Kerkyra, Greece, 2005. 2 [EFL+ 00] T. Eiter, W. Faber, N. Leone, G. Pfeifer, and A. Polleres. Planning under incomplete knowledge. Lecture Notes in Computer Science, 2000. 2 [EFL+ 03] T. Eiter, W. Faber, N. Leone, G. Pfeifer, and A. Polleres. A logic programming approach to knowledge-state planning. Artificial Intelligence, 144(1-2):157–211, 2003. 2 [EMW97] Michael Ernst, Todd D. Millstein, and Daniel S. Weld. Automatic SAT-compilation of planning problems. In IJCAI, pages 1169–1177, 1997. 2 [FL03] Maria Fox and Derek Long. pddl2.1 : An extension to pddl for expressing temporal planning domains. Journal of Artificial Intelligence Research, pages 61–124, 2003. 2 [FN71] R. Fikes and N. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189–208, 1971. 2 [GL93] M. Gelfond and V. Lifschitz. Representing action and change by logic programs. Journal of Logic Programming, 17(2-4):301–321, 1993. 2 [GL98] M. Gelfond and V. Lifschitz. Action languages. Electronic Transactions on Artificial Intelligence, 3(6), 1998. 2 [GLL+ 04] E. Giunchiglia, J. Lee, V. Lifschitz, N. McCain, and H. Turner. Nonmonotonic causal theories. Artificial Intelligence, 153:49–104, 2004. 2 [GSS06] S. Grell, T. Schaub, and J. Selbig. Modelling biological networks by action languages via answer set programming. In J. Dix and A. Hunter, editors, Proceedings of the Eleventh International Workshop on Nonmonotonic Reasoning (NMR’06), number IFI-06-04 in Technical Report Series, pages 275–283. Clausthal University of Technology, Institute for Informatics, 2006. 2 [KMS96] H. Kautz, D. McAllester, and B. Selman. Encoding plans in propositional logic. In Proceedings of the Fifth International Conference on the Principle of Knowledge Representation and Reasoning (KR’96), pages 374–384, 1996. 2 [KS92] H. Kautz and B. Selman. Planning as satisfiability. In Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI’92), pages 359–363, 1992. 2 [KS96] H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In National Conference on Artificial Intelligence (AAAI’96), pages 1194–1201, Portland, Oregon, 1996. AAAI Press. 2 [KS99] H. Kautz and B. Selman. Unifying SAT-based and graphbased planning. In J. Minker, editor, Workshop on LogicBased Artificial Intelligence, Washington, DC, June 14– 16, 1999, College Park, Maryland, 1999. Computer Science Department, University of Maryland. 2 [Lif02] V. Lifschitz. Answer set programming and plan generation. Artificial Intelligence, 138(1-2):39–54, 2002. 2 [LL03] J. Lee and V. Lifschitz. Describing additive fluents in action language C+. Proceedings of the International Joint Conference on Artificial Intelligence, 2003. 2 [LR06] V. Lifschitz and W. Ren. A modular action description language. Proceedings of the National Conference on Artificial Intelligence (AAAI), 2006. 2 [LT99] Vladimir Lifschitz and Hudson Turner. Representing transition systems by logic programs. In Logic Programming and Non-monotonic Reasoning, pages 92–106, 1999. 2 [McD98] D. McDermott. Pddl — the planning domain definition language, 1998. 2 [MT97] Norman McCain and Hudson Turner. Causal theories of action and change. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 460–465. AAAI Press, 1997. 2 [MT98] N. McCain and H. Turner. Satisfiability planning with causal theories. In A. Cohn, L. Schubert, and S. Shapiro, editors, KR’98: Principles of Knowledge Representation and Reasoning, pages 212–223. Morgan Kaufmann, San Francisco, California, 1998. 2 [RHN05] J. Rintanen, K. Heljanko, and I. Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search. Technical Report 216, Albert-LudwigsUniversität Freiburg, Institut für Informatik, 2005. 2 [Rin99] Jussi Rintanen. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research, 10:323–352, 1999. 2 [Rin03] J. Rintanen. Symmetry reduction for sat representations of transition systems. Proceedings of the 13th International Conference on Automated Planning and Scheduling, pages 32–40, 2003. 2 [Rin04a] J. Rintanen. Evaluation strategies for planning as satisfiability. Proceedings of the 16th European Conference on Artificial Intelligence, IOS Press, 2004. 2 [Rin04b] J. Rintanen. Phase transitions in classical planning: an experimental study. Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004), 710–719. AAAI Press., 2004. 2 [SP04a] T. Son and E. Pontelli. Planning with preferences in logic programming. In V. Lifschitz and I. Niemelä, editors, Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’04), volume 2923 of Lecture Notes in Artificial Intelligence, pages 247–260. Springer-Verlag, 2004. 2 [SP04b] T. Son and E. Pontelli. Reasoning about actions and planning with preferences using prioritized default theory. Computational Intelligence, 20(2):358–404, 2004. 2 [TBNJ05] Nam Tran, Chitta Baral, Vinay Nagaraj, and Lokesh Joshi. Knowledge-based integrative framework for hypothesis formation in biochemical networks. Proc. of the 2nd International Workshop on Data Integration in the Life Sciences (DILS’05), pages 121–136, 2005. 2