Maintenance goals of agents in a dynamic environment: Formulation and policy construction

Artificial Intelligence

Volumn 172, Issue 12-13, 2008, Pages 1429-1469

  Baral, Chitta ^a   Eiter, Thomas ^c   Bjäreland, Marcus ^b   Nakamura, Mutsumi ^a  

^a Arizona State University   (United States)

^b ASTRAZENECA R AND D   (Sweden)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Agent control; Answer set programming; Computational complexity of agent design; Discrete event dynamic systems; Horn theories; k maintainability; Maintenance goals; SAT solving; Self stabilization

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISCRETE EVENT SIMULATION; DYNAMIC PROGRAMMING; LOGIC PROGRAMMING; MULTI AGENT SYSTEMS; PROBLEM SOLVING;

AGENT CONTROL; ANSWER SET PROGRAMMING; DISCRETE EVENT DYNAMIC SYSTEMS; HORN THEORIES; K-MAINTAINABILITY; MAINTENANCE GOALS; SAT SOLVING; SELF STABILIZATION;

COMPUTER SOFTWARE MAINTENANCE;

EID: 46549088711     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.03.005     Document Type: Article

References (69)

1. Abadi M., Lamport L., and Wolper P. Realizable and unrealizable specifications of reactive systems. Proc. 16th International Conference on Automata, Languages, and Programming (ICALP 89). LNCS vol. 372 (1989), Springer 1-17
2. Arora A., and Gouda M.G. Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering 19 11 (1993) 1015-1027
3. Bacchus F., and Kabanza F. Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence 22 (1998) 5-27
4. Baral C., Eiter T., and Zhao J. Using SAT and LP to design polynomial-time algorithms for planning in non-deterministic domains. Proc. 20th National Conference on Artificial Intelligence (AAAI '05) (2005), AAAI Press 578-583
5. Baral C., Gelfond M., and Provetti A. Representing actions: Laws, observations, and hypothesis. Journal of Logic Programming 31 (1997) 201-243
6. Baral C., Kreinovich V., and Trejo R. Computational complexity of planning and approximate planning in the presence of incompleteness. Artificial Intelligence 122 1-2 (2000) 241-267
7. Baral C., Kreinovich V., and Trejo R. Computational complexity of planning with temporal goals. In: Nebel B. (Ed). Proc. 17th International Joint Conference on Artificial Intelligence (IJCAI-01) (2001), Morgan Kaufmann 509-514
8. Baral C., and Son T. Relating theories of actions and reactive control. Electronic Transactions on Artificial Intelligence 2 3-4 (1998) 211-271
9. Baral C., and Zhao J. Goal specification in presence of non-deterministic actions. In: de Mántaras R.L., and Saitta L. (Eds). Proc. 16th European Conference on Artificial Intelligence (ECAI 2004) (2004), IOS Press 273-277
10. M. Barbeau, F. Kabanza, R. St-Denis, Synthesizing plan controllers using real-time goals, in: Proc. 14th International Joint Conference on Artificial Intelligence (IJCAI-95), 1995, pp. 791-800
11. 1. Journal of Computer and System Sciences 41 (1990) 274-306
12. M. Ben-Ari, Z. Manna, A. Puneli, The temporal logic of branching time, in: Proc. 8th Symposium on Principles of Programming Languages, 1981, pp. 164-176
13. P. Bertoli, A. Cimatti, M. Pistore, Strong cyclic planning under partial observability, in: ECAI, 2006, pp. 580-584
14. P. Bertoli, M. Pistore, Planning with extended goals and partial observability, in: S. Zilberstein, J. Koehler, S. Koenig (Eds.), ICAPS, 2004, pp. 270-278
15. Brooks R. A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation 2 1 (1986) 14-23
16. Bylander T. The computational complexity of propositional strips planning. Artificial Intelligence 69 (1994) 165-204
17. S. Ceri, J. Widom, Deriving production rules for constraint maintenance, in: P.M.G. Apers, G. Wiederhold (Eds.), Proc. 15th International Conference on Very Large Data Bases (VLDB-90), 1990, pp. 566-577
18. Cimatti A., Pistore M., Roveri M., and Traverso P. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147 1-2 (2003) 35-84
19. Clarke E., and Emerson E. Design and synthesis of synchronization skeletons using branching-time temporal logic. Proc. Workshop on Logic of Programs. LNCS vol. 131 (1981), Springer 52-71
20. Clarke E., Emerson E., and Sistla A. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8 2 (1986) 244-263
21. Daniele M., Traverso P., and Vardi M. Strong cyclic planning revisited. Proc. 5th European Conference on Planning (ECP'99). LNCS/LNAI vol. 1809 (1999), Springer 35-48
22. Dantsin E., Eiter T., Gottlob G., and Voronkov A. Complexity and expressive power of logic programming. ACM Computing Surveys 33 3 (2001) 374-425
23. G. De Giacomo, R. Reiter, M. Soutchanski, Execution monitoring of high-level robot programs, in: Proc. Sixth Conference on Principles of Knowledge Representation and Reasoning (KR-98), 1998, pp. 453-465
24. Dijkstra E.W. Self-stabilizing systems in spite of distributed control. CACM 17 11 (1974) 644-843
25. Dowling W., and Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn theories. Journal of Logic Programming 3 (1984) 267-284
26. M. Drummond, Situation control rules, in: Proc. First International Conference on Principles of Knowledge Representation and Reasoning (KR-89), 1989, pp. 103-113
27. Dunne P., Laurence M., and Wooldridge M. Complexity results for agent design problems. Annals of Mathematics, Computing & Teleinformatics 1 1 (2003) 19-36
28. Dunne P., and Wooldridge M. Optimistic and disjunctive agent design problems. In: Castelfranchi C., and Lespérance Y. (Eds). Proc. 7th International Workshop on Intelligent Agents (ATAL VII). LNCS vol. 1986 (2001), Springer 1-14
29. Eiter T., Faber W., Leone N., and Pfeifer G. Declarative problem-solving using the DLV system. In: Minker J. (Ed). Logic-Based Artificial Intelligence (2000), Kluwer 79-103
30. Emerson E. Temporal and modal logics. In: van J. (Ed). Handbook of Theoretical Computer Science, vol. B (1990), Elsevier Chapter 16
31. Erol K., Subrahmanian V., and Nau D. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence 76 (1995) 75-88
32. Fikes R.E., and Nilsson N.J. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2 3-4 (1971) 189-208
33. Gelfond M., and Lifschitz V. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 (1991) 365-385
34. Gelfond M., and Lifschitz V. Representing action in extended logic programs. Proc. Joint International Conference and Symposium on Logic Programming (JICSLP'92) (1992), MIT Press 559-573
35. Ghallab M., Nau D., and Traverso P. Automated Planning-Theory and Practice (2004), Morgan Kaufmann
36. Ginsberg M.L. Universal planning: An (almost) universally bad idea. AI Magazine 10 4 (1989) 40-44
37. Harding A., Ryan M., and Schobbens P.-Y. A new algorithm for strategy synthesis in ltl games. In: Halbwachs N., and Zuck L.D. (Eds). TACAS. LNCS vol. 3440 (2005), Springer 477-492
38. Immerman N. Descriptive Complexity (1999), Springer
39. R.M. Jensen, M.M. Veloso, M.H. Bowling, OBDD-based optimistic and strong cyclic adversarial planning, in: Proc. 6th European Conference on Planning (ECP-01), 2001
40. R.M. Jensen, M.M. Veloso, R.E. Bryant, Fault tolerant planning: Toward probabilistic uncertainty models in symbolic non-deterministic planning, in: S. Zilberstein, J. Koehler, S. Koenig (Eds.), Proc. 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004, pp. 335-344
41. Kabanza F., Barbeau M., and St-Denis R. Planning control rules for reactive agents. Artificial Intelligence 95 1 (1997) 67-113
42. L.P. Kaelbling, S.J. Rosenschein, Action and planning in embedded agents, in: Maes [47], pp. 35-48
43. Kuratowski C. Topology I (1966), Academic Press, New York
44. U.D. Lago, M. Pistore, P. Traverso, Planning with a language for extended goals, in: AAAI/IAAI, 2002, pp. 447-454
45. Leone N., Pfeifer G., Faber W., Eiter T., Gottlob G., Perri S., and Scarcello F. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7 3 (2006) 499-562
46. M.L. Littman, Probabilistic propositional planning: Representations and complexity, in: Proc. 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI/IAAI 1997), 1997, pp. 748-754
47. In: Maes P. (Ed). Designing Autonomous Agents: Theory and Practice from Biology to Engineering and Back (1990), MIT Press
48. Manna Z., and Pnueli A. The Temporal Logic of Reactive and Concurrent Systems Specification (1992), Springer
49. Manna Z., and Wolper P. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems 6 1 (1984) 68-93
50. Minoux M. LTUR: A simplified linear time unit resolution for Horn formulae and computer implementation. Information Processing Letters 29 (1988) 1-12
51. Nakamura M., and Baral C. Invariance, maintenance and other declarative objectives of triggers-a formal characterization of active databases. In: Lloyd J. (Ed). Proc. First International Conference on Computational Logic (CL 2000). LNAI vol. 1861 (2000), Springer 1210-1224
52. Nakamura M., Baral C., and Bjæreland M. Maintainability: A weaker stabilizability like notion for high level control. Proc. 17th National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI 2000) (2000), AAAI Press 62-67
53. Niemelä I., Simons P., and Syrjänen T. Smodels: A system for answer set programming. In: Baral C., and Truszczyński M. (Eds). Proc. 8th International Workshop on Non-Monotonic Reasoning (NMR'2000) (2000). http://xxx.lanl.gov/abs/cs.AI/0003033 available at
54. Niyogi R., and Sarkar S. Logical specification of goals. In: Ghosh R.K., and Misra D. (Eds). Proc. 3rd International Conference on Information Technology (CIT 2001) (2000), Tata McGraw-Hill 77-82
55. Ortiz C. A commonsense language for reasoning about causation and rational action. Artificial Intelligence 111 2 (1999) 73-130
56. Ozveren O., Willsky A., and Antsaklis P. Stability and stabilizability of discrete event dynamic systems. Journal of ACM 38 3 (1991) 730-752
57. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
58. Passino K., and Burgess K. Stability Analysis of Discrete Event Systems (1998), John Wiley and Sons
59. N. Piterman, A. Pnueli, Y. Sa'ar, Synthesis of reactive(1) designs, in: VMCAI, 2006, pp. 364-380
60. A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. 16th Annual ACM Symposium on Principles of Programming Languages (POPL 1989), 1989, pp. 179-190
61. Ramadge P., and Wonham W. Modular feedback logic for discrete event systems. SIAM Journal of Control and Optimization 25 5 (1987) 1202-1217
62. Ramadge P., and Wonham W. Supervisory control of a class of discrete event process. SIAM Journal of Control and Optimization 25 1 (1987) 206-230
63. Reiter R. Knowledge in Action: Logical Foundation for Describing and Implementing Dynamical Systems (2001), MIT Press
64. J. Rintanen, Complexity of planning with partial observability, in: S. Zilberstein, J. Koehler, S. Koenig, (Eds.), Proc. 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004, pp. 345-354
65. Simons P., Niemelä I., and Soininen T. Extending and implementing the stable model semantics. Artificial Intelligence 138 (2002) 181-234
66. Sontag E. Stability and stabilization: Discontinuities and the effect of disturbances. In: Clarke F., and Stern R. (Eds). Proc. NATO Advanced Study Institute (1998), Kluwer 551-598
67. Weld D., and Etzioni O. The first law of robotics (a call to arms). Proc. Twelfth National Conference on Artificial Intelligence (AAAI-94) (1994), AAAI Press 1042-1047
68. In: Widom J., and Ceri S. (Eds). Active Database Systems: Triggers and Rules For Advanced Database Processing (1996), Morgan Kaufmann
69. Wooldridge M. The computational complexity of agent design problems. Proc. Fourth International Conference on Multi-Agent Systems (ICMAS 2000) (2000), IEEE Press 341-348