Logic of conflicts between decision making agents

Journal of Logic and Computation

Volumn 10, Issue 4, 2000, Pages 583-602

  Ekenberg, Love ^a,b  

^a STOCKHOLM UNIVERSITY   (Sweden)

^b MID SWEDEN UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FORMAL LANGUAGES; MATHEMATICAL MODELS; THEOREM PROVING;

AUTONOMOUS AGENT; CONCEPTUAL SCHEMA; CONFLICT DETECTION; MULTIAGENT SYSTEM;

FORMAL LOGIC;

EID: 0034250830     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/10.4.583     Document Type: Article

References (44)

1. S. Abiteboul and V. Vianu. Equivalence and optimization of relational transactions. Journal of ACM, 35, 130-145, 1988.
2. J. van Benthem and J. Bergstra. Logic of transition systems. Journal of Logic, Language and Information, 3, 247-283, 1995.
3. E. W. Beth. The Foundations of Mathematics. North Holland, 1959.
4. M. Boman. Norms in artificial decision making. Artificial Intelligence and Law, 7, 17-35, 1999.
5. N. Carver and V. Lesser. The DRESUN testbed for research in FA/C distributed situation assessment: Extensions to the model of external evidence. Proceedings of the First International Conference on Multi-Agent Systems, pp. 33-40, 1995.
6. CCITT. CCITT Recommendation Z. 100: Specification and Description Language SDL. (Blue Book, Volume X.1-X.5): ITU General Secretariat-Sales Section, Places des Nations, CH-1211 Geneva 20, 1988.
7. J. Chu-Carroll and S. Carberry. Communication for conflict resolution in multi-agent planning. Proceedings of the First International Conference on Multi-Agent Systems, pp. 49-56, 1995.
8. S. Cook and R. Reckhow. The relative efficiency of prepositional proof systems. Journal of Symbolic Logic, 44, 36-50, 1979.
9. M. D'Agostino. Investigations into the complexity of some propositional calculi. Technical Monograph PRG-88, Ph. D. Thesis, Oxford University, 1990.
10. M. Danielson. Computational Decision Analysis. PhD Thesis, Department of Computer and Systems Sciences: Royal Inst. of Technology, 1997.
11. M. Danielson and L. Ekenberg. A framework for analysing decisions under risk. European Journal of Operations Research, 104, 474-484, 1998.
12. G. Davies and L. Ekenberg. Agent metaphors for analysing telematic services. Proceedings of IATA, LNAI 1437, pp. 156-170, Springer Verlag, 1998.
13. C. Dixon, M. Fisher and M. Wooldridge. Resolution for temporal logics of knowledge. Journal of Logic and Computation, 8, 345-372, 1998.
14. B. Dreben and W. D. Goldfarb. The Decision Problem: Solvable Classes of Quantification Formulas, Addison-Wesley, Reading, MA, 1979.
15. L. Ekenberg. Modelling decentralised decision making. Proceedings of ICMAS'96, pp. 64-71, AAAI/The MIT Press, 1996.
16. L. Ekenberg, M. Danielson, and M. Boman. From local assessments to global rationality. International Journal of Intelligent and Cooperative Information Systems, 5, 315-331, 1996.
17. L. Ekenberg and P. Johannesson. A formal basis for dynamic schema integration. Proceedings of 15th International Conference on Conceptual Modelling ER'96, pp. 211-226, Lecture Notes in Computer Science, Springer-Verlag, 1996.
18. L. Ekenberg, M. Danielson, and M. Boman. Imposing security constraints on agent-based decision support. Decision Support Systems International Journal, 20, 3-15, 1997.
19. L. Ekenberg, M. Boman, and J. Linneroth-Bayer. General risk constraints. To appear in Journal of Risk Research, 2000.
20. E. Ephrati and J. S. Rosenschein. The Clarke tax as a consensus mechanism among automated agents. Proceedings of the Ninth National Conference on Artificial Intelligence, pp. 173-178, AAAI Press/The MIT Press, 1991.
21. P. Johannesson and P. Wohed. Modelling Agent Communtication in a first order logic. Accounting Management and Information Technologies, 8, 5-22, 1998.
22. D. S. Johnson. A catalogue of complexity Classes. In Handbook of Theoretical Computer Science, A, J. van. Leeuwen, ed., Amsterdam: Elsevier, 1990.
23. M. J. Katz and J. S. Rosenschein. Verifying plans for multiple agents. Journal of Experimental and Theoretical Artificial Intelligence, 5, 39-56, 1993.
24. S. Kraus, E. Ephrati and D. Lehmann. Negotiation in a non-cooperative environment. Journal of Experimental and Theoretical Artificial Intelligence, 3, 255-282, 1991.
25. S. Kraus and J. Wilkenfeld. The function of time in cooperative negotiations. Proceedings of the Ninth National Conference of Artificial Intelligence, pp. 179-184, 1991.
26. K. Kuwabara and V. R. Lesser. Extended protocol for multistage negotiation. Proceedings of the Ninth Workshop on Distributed Artificial Intelligence, pp. 129-161, Rosario, Washington, 1989.
27. Ee-Peng Lim, J. Srivastava and S. Shekhar. Resolving attribute incompatibility in database integration: an evidential reasoning approach. Dept. of Computer Science, Univ. of Minnesota, publication 1063-6382/94, 1994.
28. M. Mondadori. Classical Analytical Deduction. Annali dell'Universit di Ferrara, Sezione III, Discussion paper, n. 1, Universita di Ferrara, 1988.
29. M. Mondadori. Classical Analytical Deduction, part II. Annali dell'Universit di Ferrara, Sezione III, Discussion paper, n. 5, Universita di Ferrara, 1988.
30. Y. Moses and M. Tennenholtz. Artificial social systems part1: Basic principles. Technical Report CS90-12, Weizmann Institute, 1990.
31. A. S. Rao and M. P. Georgeff. BDI agents: from theory to practice. Proceedings of the First International Conference on Multi-Agent Systems, pp. 313-319, 1995.
32. A. S. Rao and M. P. Georgeff. Decision procedures for BDI logics. Journal of Logic and Computation, 8, 293-342, 1998.
33. J. A. Robinson. A machine oriented logic based on the resolution principle. Journal of the ACM, 12, 23-41, 1965.
34. J. S. Rosenschein. Synchronization of multi-agent plans. Proceedings of National Conference of Artificial Intelligence, pp. 115-119, 1982.
35. J. S. Rosenschein and G. Zlotkin. Rules of Encounter. The MIT Press, 1994.
36. P. Shoemaker. The expected utility model: its variants, purposes, evidence and limitations. Journal of Economic Literature, XX, 529-563, 1982.
37. Y. Shoham. Agent-oriented programming. Artificial Intelligence, 60, 51-92, 1993.
38. Y. Shoham and M. Tennenholtz. On social laws for artificial agent societies: off-line design. Artificial Intelligence, 73, 231-252, 1993.
39. R. M. Smullyan. First-Order Logic. Springer Verlag, 1968.
40. G. Stålmarck. System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are Generated from a Formula. US, Patent No. 5 276 897 1995.
41. G. Stålmarck, L. Ekenberg, S. Berg, I. Olsson and F. Nordberg. Pilot study of formal analysis of service interaction, validation and verification. Telia Research AB, 1996.
42. K. P. Sycara. Resolving goal conflicts via negotiations. Proceedings of the Seventh National conference on artificial Intelligence, pp. 245-250, St. Paul Minnesota, 1988.
43. P. van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.
44. G. Zlotkin and J. S. Rosenschein. Incomplete information and deception in multi-agent negotiation. Proceedings of 12th IJCAI, pp. 225-231, 1991.