Heterogeneous active agents, II: algorithms and complexity

Artificial Intelligence

Volumn 108, Issue 1, 1999, Pages 257-307

  Eiter, Thomas ^a   Subrahmanian, V S ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER SOFTWARE; FORMAL LANGUAGES;

AGENT LANGUAGES; AGENT PROGRAMS; HETEROGENEOUS ACTIVE AGENTS; SOFTWARE AGENTS;

COMPUTATIONAL COMPLEXITY;

EID: 0033620272     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00006-5     Document Type: Article

References (27)

1. [1] M. Bratman, D. Israel, M. Pollack, Plans and resource-bounded practical reasoning, Comput. Intelligence 4 (4) (1988) 349-355.
2. [2] M. Cadoli, The complexity of model checking for circumscriptive formulae, Inform. Process. Lett. 44 (1992) 113-118.
3. [3] Z.-Z. Chen, S. Toda, The complexity of selecting maximal solutions, in: Proceedings 8th IEEE Structure in Complexity Theory Conference, 1993, pp. 313-325.
4. [4] Z.-Z. Chen, S. Toda, The complexity of selecting maximal solutions, Inform, and Comput. 119 (1995) 231-239.
5. [5] P. Cohen, H. Levesque, Intention is choice with commitment, Artificial Intelligence 42 (1990) 263-310.
6. [6] E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov, Complexity and expressive power of logic programming, in: Proceedings 12th IEEE International Conference on Computational Complexity (CCC-97), 1997, pp. 82-101.
7. [7] T. Eiter, G. Gottlob, N. Leone, Abduction from logic programs: semantics and complexity, Theoret. Comput. Sci. 189 (1-2) (1997) 129-177.
8. [8] T. Eiter, G. Gottlob, H. Mannila, Disjunctive datalog, ACM Trans. Database Systems 22 (3) (1997) 364-417.
9. [9] T. Eiter, V. Subrahmanian, Regular agent programs and their implementation, in preparation.
10. [10] T. Eiter, V.S. Subrahmanian, G. Pick, Heterogeneous active agents, I: Semantics, Artificial Intelligence 108 (1999) 179-255 (this issue).
11. [11] T. Eiter, V. Subrahmanian, G. Pick, Heterogeneous active agents, II: Algorithms and complexity, Technical Report INFSYS RR-1843-98-03, Institut für Informationsysteme, Technische Universität Wien, 1998.
12. [12] S. Fenner, S. Homer, M. Ogihara, A. Selman, Oracles that compute values, SIAM J. Comput. 26 (4) (1997) 1043-1065.
13. [13] M. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
14. [14] G. Gottlob, Complexity results for nonmonotonic logics, J. Logic Comput. 2 (3) (1992) 397-425.
15. [15] G. Gottlob, N. Leone, H. Veith, Second-order logic and the weak exponential hierarchies, in: J. Wiedermann, P. Hajek (Eds.), Proceedings Conference Mathematical Foundations of Computer Science (MFCS-95), Prague, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 66-81. Full paper CD/TR 95/80, Information Systems Department, TU Wien, 1995.
16. [16] J. Halpern, M. Vardi, Model checking vs. theorem proving: A manifesto, in: Proceedings 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA, 1991, pp. 325-334.
17. [17] K. Hindriks, F. de Boer, W. van der Hoek, J. Meyer, Formal semantics of an abstract agent programming language, in: Proceedings Internat. Workshop on Agent Theories, Architectures, and Languages, Providence, RI, 1997, pp. 204-218.
18. [18] B. Jenner, J. Toran, The complexity of obtaining solutions for problems in NP and NL, in: A. Selman (Ed.), Complexity Theory: A Retrospective II, Springer, Berlin, 1998.
19. [19] D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A, Elsevier (North-Holland), Amsterdam, 1990, Chapter 2.
20. [20] P. Liberatore, M. Schaerf, The complexity of model checking for belief revision and update, in: Proceedings AAAI-96, Portland, OR, 1996, pp. 556-561.
21. [21] C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
22. [22] A. Rao, M. Georgeff, Modeling rational agents within a BDI-architecture, in: J.F. Allen, R. Fikes, E. Sandewall (Eds.), Proceedings International Conference on Knowledge Representation and Reasoning (KR-91), Cambridge, MA, Morgan Kaufmann, San Mateo, CA, 1991, pp. 473-484.
23. [23] R. Reiter, Equality and domain closure in first-order databases, J. ACM 27 (2) (1980) 235-259.
24. [24] A. Selman, A taxonomy of complexity classes of functions, J. Comput. System Sci. 48 (1994) 357-381.
25. [25] Y. Shoham, Agent oriented programming, Artificial Intelligence 60 (1993) 51-92.
26. [26] J.D. Ullman, Principles of Database and Knowledge Base Systems, Computer Science Press, 1989.
27. [27] M. Vardi, Complexity of relational query languages, in: Proceedings 14th STOC, San Francisco, CA, 1982, pp. 137-146.