Abstract
Symbolic negotiation is regarded in the field of computer science as a process, where parties try to reach an agreement on the high-level means for achieving their goals by applying symbolic reasoning techniques. It has been proposed [1] that symbolic negotiation could be formalised as Partial Deduction (PD) in Linear Logic (LL). However, the paper [1] did not provided a formalisation of the PD process in LL.
In this paper we fill the gap by providing a formalisation of PD for !-Horn fragment of LL. The framework can be easily extended for other fragments of LL as well such that more comprehensive aspects of negotiation can be described. In this paper we consider also soundness and completeness of the formalism. It turns out that, given a certain PD procedure, PD for LL in !-Horn fragment is sound and complete.
We adopt the hypothesis that an essential component of symbolic negotiation is Cooperative Problem Solving (CPS). Thus a formal system for symbolic negotiation would consist of CPS rules plus negotiation-specific rules. In this paper only CPS rules are under investigation while negotiation-specific rules shall be published in another paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Küngas, P., Matskin, M.: Linear logic, partial deduction and cooperative problem solving. In: Leite, J., Omicini, A., Sterling, L., Torroni, P. (eds.) DALT 2003. LNCS (LNAI), vol. 2990, pp. 263–279. Springer, Heidelberg (2004)
Komorowski, J.: A Specification of An Abstract Prolog Machine and Its Application to Partial Evaluation. PhD thesis, Department of Computer and Information Science, Linkoping University, Linkoping, Sweden (1981)
Girard, J.Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)
Kanovich, M.I.: Linear logic as a logic of computations. Annals of Pure and Applied Logic 67, 183–212 (1994)
Lehmann, H., Leuschel, M.: Solving planning problems by partial deduction. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 451–467. Springer, Heidelberg (2000)
Lloyd, J.W., Shepherdson, J.C.: Partial evaluation in logic programming. Journal of Logic Programming 11, 217–242 (1991)
Lincoln, P.: Linear logic. ACM SIGACT Notices 23, 29–37 (1992)
Lincoln, P.: Deciding provability of linear logic formulas. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Note Series, vol. 222, pp. 109–122. Cambridge University Press, Cambridge (1995)
Kanovich, M.I., Vauzeilles, J.: The classical AI planning problems in the mirror of Horn linear logic: Semantics, expressibility, complexity. Mathematical Structures in Computer Science 11, 689–716 (2001)
Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM Journal on Computing 13, 441–460 (1984)
Tammet, T.: Proof strategies in linear logic. Journal of Automated Reasoning 12, 273–304 (1994)
Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and Systems Sciences 3, 147–195 (1969)
Andreoli, J.M., Pareschi, R., Castagnetti, T.: Static analysis of linear logic programming. New Generation Computing 15, 449–481 (1997)
Leuschel, M., Lehmann, H.: Solving coverability problems of Petri nets by partial deduction. In: Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP 2000, Montreal, Canada, September 20–23, pp. 268–279. ACM Press, New York (2000)
de Schreye, D., Glück, R., Jørgensen, J., Leuschel, M., Martens, B., Sørensen, M.H.: Conjunctive partial deduction: Foundations, control, algorithms and experiments. Journal of Logic Programming 41, 231–277 (1999)
Matskin, M., Komorowski, J.: Partial structural synthesis of programs. Fundamenta Informaticae 30, 23–41 (1997)
Muggleton, S., de Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming 19/20, 629–679 (1994)
Harland, J., Pym, D., Winikoff, M.: Forward and backward chaining in linear logic. In: Proceedings of the CADE-17 Workshop on Proof-Search in Type-Theoretic Systems, Pittsburgh, June 20–21, 2000. Electronic Notes in Theoretical Computer Science, vol. 37. Elsevier, Amsterdam (2000)
Nebel, B., Koehler, J.: Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence 76, 427–454 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Küngas, P., Matskin, M. (2005). Partial Deduction for Linear Logic—The Symbolic Negotiation Perspective. In: Leite, J., Omicini, A., Torroni, P., Yolum, p. (eds) Declarative Agent Languages and Technologies II. DALT 2004. Lecture Notes in Computer Science(), vol 3476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493402_3
Download citation
DOI: https://doi.org/10.1007/11493402_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26172-8
Online ISBN: 978-3-540-31927-6
eBook Packages: Computer ScienceComputer Science (R0)