Skip to main content
SpringerLink
Log in

Partial Deduction for Linear Logic—The Symbolic Negotiation Perspective

  • Conference paper
Book cover Declarative Agent Languages and Technologies II (DALT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3476))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. 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)

    Google Scholar 

  3. Girard, J.Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kanovich, M.I.: Linear logic as a logic of computations. Annals of Pure and Applied Logic 67, 183–212 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Lloyd, J.W., Shepherdson, J.C.: Partial evaluation in logic programming. Journal of Logic Programming 11, 217–242 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lincoln, P.: Linear logic. ACM SIGACT Notices 23, 29–37 (1992)

    Article  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. 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)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM Journal on Computing 13, 441–460 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  11. Tammet, T.: Proof strategies in linear logic. Journal of Automated Reasoning 12, 273–304 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and Systems Sciences 3, 147–195 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  13. Andreoli, J.M., Pareschi, R., Castagnetti, T.: Static analysis of linear logic programming. New Generation Computing 15, 449–481 (1997)

    Article  Google Scholar 

  14. 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)

    Chapter  Google Scholar 

  15. 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)

    Article  MATH  MathSciNet  Google Scholar 

  16. Matskin, M., Komorowski, J.: Partial structural synthesis of programs. Fundamenta Informaticae 30, 23–41 (1997)

    MathSciNet  Google Scholar 

  17. Muggleton, S., de Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming 19/20, 629–679 (1994)

    Article  Google Scholar 

  18. 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)

    Google Scholar 

  19. Nebel, B., Koehler, J.: Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence 76, 427–454 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway

    Peep Küngas

  2. Department of Microelectronics and Information Technology, Royal Institute of Technology, Kista, Sweden

    Mihhail Matskin

Authors
  1. Peep Küngas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mihhail Matskin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática, Universidade Nova de Lisboa, 2829-516, Caparica, Portugal

    João Leite

  2. Alma Mater Studiorum Università di Bologna a Cesena, via Venezia 52, 47023, Cesena, Italy

    Andrea Omicini

  3. DEIS, University of Bologna, V.le Risorgimento 2, 40136, Bologna, Italy

    Paolo Torroni

  4. Department of Computer Engineering, Boğaziçi University, Bebek, 34342, Istanbul, Turkey

    pInar Yolum

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation