CSE 591 Autonomous Agents, Fall 04

The reading list of papers, book chapters and slides.

• *** M. Gelfond and V. Lifschitz,  Representing action and change by logic programs,
         Journal of Logic Programming, Vol. 17, 1993, pp. 301-321.



 
• C. Baral. Chapter 5 of the book: Knowledge representation, reasoning and declarative problem solving.

 
• Michael Gelfond and Vladimir Lifschitz: Action Languages. Electronic

  Transactions on Artificial Intelligence, Vol. 2 (1998), Issue 3-4, pp.
  193-210. http://www.ep.liu.se/ej/etai/1998/007/.
• *** G. Neelakantan Kartha,

Soundness and Completeness Theorems for Three Formalizations of Action.
IJCAI 1993: 724-731
 
• *** Paolo Liberatore: The Complexity of the Language A. Electronic

   Transactions on Artificial Intelligence, Vol. 1 (1997), Issue 1-3, pp. 13-38.
   http://www.ep.liu.se/ej/etai/1997/002/.
 
 
• Reasoning about Effects of Concurrent Actions.
         C. Baral, and M. Gelfond.
         In Journal of Logic Programming, vol 31(1-3), pgs 85-117, 1997.
         * Abstract.
         * The version in Journal of Logic Programming. (postscript)
         (A thoroughly revised version of an IJCAI 93 paper.)

 
• *** G. N. Kartha and V. Lifschitz,

Actions with indirect effects (preliminary report),
Proceedings  of the Fourth International Conference on Principles of
          Knowledge Representation and Reasoning, 1994, pp. 341-350.
 
• Reasoning about actions: non-deterministic effects, constraints, and qualification.
          Chitta Baral.
         * Abstract.
         * IJCAI 95, pgs 2017-2023. (postscript)

 
• *** H. Turner,

Representing actions in logic programs and default theories: A situation calculus approach,
Journal of Logic Programming, Vol. 31, pp. 245-298, 1997.
 
• Representing Actions: Laws, Observation and Hypothesis.
         C. Baral, M. Gelfond, and A. Provetti.
         In Journal of Logic Programming, Vol 31(1-3), 201-243, 1997.
        * Abstract.
        * The version in Journal of Logic Programming. (postscript)

 
• Formalizing narratives using nested circumscription.
          C. Baral, A. Gabaldon and A. Provetti.
          In Artificial Intelligence journal, 104/1-2, pages 107-164, Sept 1998.
         * Abstract.
         * Version that appears in the Artificial Intelligence journal. (postscript)
         * The AAAI 96 version, pgs 652-657. (postscript)

 
• Formalizing sensing actions -- a transition function based approach.
          C. Baral and T. Son.
          In Artificial Intelligence Journal, 125 (1-2), pgs 19-91, Jan 2001.
          * Abstract.
          * Version to appear in Artificial Intelligence Journal (postscript)
          * Technical report with all the proofs. (postscript)
          * A subset of it that appears in the International logic programming Symposium (ILPS), pgs 387-401, 1997. (postscript)

 
• Formulating diagnostic problem solving using an action language with narratives and sensing.
Chitta Baral, Sheila McIlraith, and Tran Cao Son.
* Abstract.

* In KR 2000, pgs 311-322. (postscript)
 
 
• Computational complexity of planning and approximate planning in presence of incompleteness.
          C. Baral, V. Kreinovich, and R. Trejo.
          In Artificial Intelligence Journal, 122(1-2),241-267, 2000.
          * Abstract.
          * Initial version appeared in IJCAI 99, pgs 948-953.
          * Version in Artificial Intelligence Journal (postscript)

 
• Ch 4 and 6 from the book Heteregenous Agent Systems by Subrahmanian et al.
          MIT press, 2000.

 
• R. Reiter.

Natural actions, concurrency and continuous time in the situation calculus.
In Principles of Knowledge Representation and Reasoning:  Proceedings of the Fifth International Conference (KR'96) ,
Cambridge, Massachusetts, U.S.A. November 5-8, 1996.
 
• R. Reiter.

The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression.
Artificial Intelligence and  Mathematical Theory of Computation: Papers in Honor of John McCarthy,
Vladimir Lifschitz (ed.), Academic Press, San Diego, CA, 1991,      pp.359-380.
 
 
 
• Patrick Doherty, Joakim Gustafsson, Lars Karlsson, and Jonas   Kvarnström,

TAL: Temporal Action Logics Language   Specification and Tutorial.
Electronic Transactions on Artificial   Intelligence, Vol. 2 (1998), Issue 3-4, pp. 273-306.
  http://www.ep.liu.se/ej/etai/1998/009/.
 
• PDDL2.1. D. Long and M. Fox.
 
Describing goals and directives (5 classes)
 
•   *** Goal specification in presence of non-deterministic actions.

C. Baral and Jicheng Zhao.
In proceedings of ECAI'04, pages 273-277.
•   *** Computational Complexity of Planning with Temporal Goals.

C. Baral et al.
DRAFT.
•  Logical specification of goals.
           R. Niyogi and S. Sarkar.
           3rd international conference on Information Technology. pgs 77-82.

 
• Using Temporal Logics to Express Search Control Knowledge for Planning,

F. Bacchus and F. Kabanza, Artificial Intelligence volume 16, pages      123--191, 2000.
 
 
• Planning for Temporally Extended Goals,

F. Bacchus and F. Kabanza,
Annals of Mathematics and Artificial Intelligence, vol. 22, pages 5--27, 1998.
 
• Computational Complexity of Planning with Temporal Goals.
          C. Baral, V. Kreinovich and R. Trejo.
          To appear in IJCAI 2001.

 
• Maintainability: a weaker stabilizability like notion for high level control.
          Mutsumi Nakamura, Chitta Baral and Marcus Bjareland.
         * Abstract.
         * In AAAI 2000, pgs 62-67. (postscript)

 
 

Describing complex plans and agent architectures (7 classes)
 

• Maintenance goals of agents in a dynamic environment: formulation and policy construction.
          Chitta Baral, Thomas Eiter, Marcus Bjareland and Mutsumi Nakamura.
          Revised version of an AAAI'02 and an ICAPS'04 paper. Submitted to a journal.
 
• Planning with domain-dependent knowledge of different kinds -- an answer set programming approach.
          Tran Cao Son, Chitta Baral and Sheila McIlraith.
          To appear in LPNMR'01.

 
• Reasoning agents in dynamic domains.
          C. Baral and M. Gelfond.
          * Abstract.
          * To appear in ``Logic based AI'' (postscript)
          editor J. Minker. Kluwer Academic Publishers.

 
• Relating theories of actions and reactive control
          C. Baral and T. Son.
          In ETAI (Electronic transactions of AI), 2(3-4):211-271, 1998.
         * Abstract.
         * The initial version. (postscript)
         * The current version -- shortened and revised. (postscript)
         * The ETAI version. .

 
• From theory to practice: the UTEP robot in AAAI 96 and 97 robot contests.
          C. Baral, L. Floriano, A. Hardesty, D. Morales, M. Nogueira, and T.C. Son
          * Abstract.
          * In Proc. of the second international conference on automated agents (Agents 98), 32-38. (in postscript)

 
• H.J. Levesque, R. Reiter, Y. Lespérance, F. Lin and R. Scherl.

GOLOG: A Logic Programming Language for Dynamic Domains.
Journal of Logic Programming, 31, 59-84, 1997.
 
• G. De Giacomo, R. Reiter and M. Soutchanski. Execution monitoring of high-level robot programs.

Principles of Knowledge Representation and  Reasoning: Proceedings of the Sixth International Conference (KR'98).
 
• Raymond Reiter, Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems.

MIT Press, 2001. (Chapter 6)
 
• Chapter  6 from the book Heteregenous Agent Systems by Subrahmanian et al. MIT press, 2000.

 
Agents in uncertain and stochastic environments. (7 classes)
 
• Reasoning about actions in a probabilistic setting.
          C. Baral and L. Tuan.
          In Common Sense 2001.

 
• Towards feasible approach to plan checking under probabilistic uncertainty.
          Raul Trejo, Vladik Kreinovich and Chitta Baral.
         * Abstract.
         * In AAAI 2000, pgs 545-550. (postscript)

 
 
• High-Level Planning and Control with Incomplete Information Using POMDPs

H. Geffner and B. Bonet. Proceedings Fall AAAI Symposium on Cognitive Robotics, 1998.
 
• Solving Large POMDPs by Real Time Dynamic Programming

H. Geffner and B. Bonet. Working Notes Fall AAAI Symposium on POMDPS. 1998. (Abstract)
• The Frame Problem and Bayesian Network Action Representations
          Craig Boutilier and Moises Goldszmidt  Appeared, CSCSI-96, Toronto, May 1996.
 
• Decision-Theoretic, High-level Agent Programming in the Situation Calculus
         Craig Boutilier, Ray Reiter, Mikhail Soutchanski and Sebastian Thrun. AAAI 2000.
 
• Reasoning about Noisy Sensors and Effectors in the Situation Calculus,

F. Bacchus, J. Y. Halpern, and H. J. Levesque, Artificial Intelligence vol 111, pages 171-208, 1999..
 
• Symbolic Dynamic Programming for First-order MDPs,

Craig Boutilier, Ray Reiter and Bob Price
IJCAI-01.