Symbolic negotiation with linear logic

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3259, Issue , 2004, Pages 71-88

  Küngas, Peep ^a   Matskin, Mihhail ^b  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); FORMAL LOGIC; LINEAR SYSTEMS; LOGIC PROGRAMMING; PLANNING; SOFTWARE AGENTS; SPECIFICATIONS; THEOREM PROVING;

COMMUNICATION ADAPTER (CA); LINEAR LOGIC; SYMBOLIC AGENTS; SYMBOLIC NEGOTIATION;

MULTI AGENT SYSTEMS;

EID: 23144453269     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30200-1_5     Document Type: Conference Paper

References (26)

1. L. Amgoud, S. Parsons, N. Maudet. Arguments, Dialogue and Negotiation. In Proceedings of 14th European Conference on Artificial Intelligence, Berlin, Germany, August 20-25, 2000, pp. 338-342, IOS Press, 2000.
2. M. P. Bonacina. A Taxonomy of Parallel Strategies for Deduction. Annals of Mathematics and Artificial Intelligence, Vol. 29, No. 1-4, pp. 223-257, 2000.
3. M. Bozzano, G. Delzanno, M. Martelli, V. Mascardi, F. Zini. Logic Programming & Multi-Agent Systems: a Synergic Combination for Applications and Semantics. In The Logic Programming Paradigm: a 25-Year Perspective, pp. 5-32, Springer-Verlag, 1999.
4. P. R. Cohen, H. J. Levesque. Teamwork. Nous, Vol. 25, No. 4, pp. 487-512, 1991.
5. M. Fisher, M. Wooldridge. Distributed Problem-Solving as Concurrent Theorem Proving. In Proceedings of 8th European Workshop on Modelling Autonomous Agents in a Multi-Agent World, Ronneby, Sweden, May 13-16, 1997. Lecture Notes in Computer Science, Vol. 1237, pp. 128-140, Springer-Verlag, 1997.
6. M. Fisher. Characterising Simple Negotiation as Distributed Agent-Based Theorem-Proving - A Preliminary Report. In Proceedings of the Fourth International Conference on Multi-Agent Systems, Boston, July 2000, IEEE Press.
7. D. Fuchs. Requirement-Based Cooperative Theorem Proving. In Proceedings of JELIA-1998, Dagstuhl, Germany, October 12-15, 1998, Lecture Notes in Artificial Intelligence, Vol. 1489, pp. 139-153, Springer, 1998.
8. J. A. Giampapa, K. Sycara. Conversational Case-Based Planning for Agent Team Coordination. In D. W. Aha, I. Watson (eds). Case-Based Reasoning Research and Development: Proceedings of the Fourth International Conference on Case-Based Reasoning, ICCBR 2001, July 2001, Lecture Notes in Artificial Intelligence, Vol. 2080, pp. 189-203, Springer-Verlag, 2001.
9. J.-Y. Girard. Linear Logic. Theoretical Computer Science, Vol. 50, pp. 1-102, 1987.
10. B. Grosz, S. Kraus. Collaborative Plans for Complex Group Actions. Artificial Intelligence, Vol. 86, pp. 269-357, 1996.
11. J. Harland, M. Winikoff. Agent Negotiation as Proof Search in Linear Logic. In Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2002), July 15-19, 2002, Bologna, Italy.
12. J. Harland, M. Winikoff. Language Design Issues for Agents based on Linear Logic. In Proceedings of the Workshop on Computational Logic in Multi-Agent Systems (CLIMA'02), August 2002.
13. T. Hirai. Propositional Temporal Linear Logic and its Application to Concurrent Systems. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Special Section on Concurrent Systems Technology), Vol. E83-A, No. 11, pp. 2219-2227, November 2000.
14. N. R. Jennings, P. Faratin, A. R. Lomuscio, S. Parsons, C. Sierra, M. Wooldridge. Automated Negotiation: Prospects, Methods and Challenges, International Journal of Group Decision and Negotiation, Vol. 10, No. 2, pp. 199-215, 2001.
15. M. Kanovich, T. Ito. Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract). In Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29-July 2, 1997, pp. 48-57, IEEE Computer Society Press, 1997.
16. J. Komorowski. A Specification of An Abstract Prolog Machine and Its Application to Partial Evaluation. PhD thesis, Technical Report LSST 69, Department of Computer and Information Science, Linkoping University, Linkoping, Sweden, 1981.
17. S. Kraus, K. Sycara, A. Evenchik. Reaching Agreements through Argumentation: A Logical Model and Implementation. Artificial Intelligence, Vol. 104, No. 1-2, pp. 1-69, 1998.
18. P. Küngas, M. Matskin. Linear Logic, Partial Deduction and Cooperative Problem Solving. Proceedings of the First International Workshop on Declarative Agent Languages and Technologies (DALT 2003), Melbourne, Australia, July 15, 2003, Lecture Notes in Artificial Intelligence Series, Vol. 2990, Springer-Verlag, 2004.
19. H. J. Levesque, P. R. Cohen, J. H. T. Nunes. On Acting Together. In Proceedings of the Eighth National Conference on Artificial Intelligence, AAAI-90, pp. 94-99, 1990.
20. P. Lincoln. Linear Logic. ACM SIGACT Notices, Vol. 23, No. 2, pp. 29-37, Spring 1992.
21. P. Lincoln. Deciding Provability of Linear Logic Formulas. In J.-Y. Girard, Y. Lafont, L. Regnier (eds). Advances in Linear Logic, London Mathematical Society Lecture Note Series, Vol. 222, pp. 109-122, 1995.
22. J. W. Lloyd, J. C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, Vol. 11, pp. 217-242, 1991.
23. S. Martini, A. Masini. A Modal View of Linear Logic. Journal of Symbolic Logic, Vol. 59, No. 3, pp. 888-899, September 1994.
24. S. Parsons, C. Sierra, N. Jennings. Agents that Reason and Negotiate by Arguing. Journal of Logic and Computation, Vol. 8, No. 3, pp. 261-292, 1998.
25. J. Rao, P. Küngas, M. Matskin. Application of Linear Logic to Web Service Composition. In Proceedings of the First International Conference on Web Services (ICWS 2003), Las Vegas, USA, June 23-26, 2003, pp. 3-9, CSREA Press, 2003.
26. F. Sadri, F. Toni, P. Torroni. Logic Agents, Dialogues and Negotiation: An Abductive Approach. In Proceedings of the Symposium on Information Agents for E-Commerce, Artificial Intelligence and the Simulation of Behaviour Convention (AISB-2001), York, UK, March 21-24, 2001.