Partial deduction for linear logic—the symbolic negotiation perspective

Authors:
Peep Küngas;Mihhail Matskin
Affiliations:
Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway;Department of Microelectronics and Information Technology, Royal Institute of Technology, Kista, Sweden
Venue:
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
Year:
2004

Citing 11
Cited 3

Linear logic

Theoretical Computer Science
Partial evaluation in logic programming

Journal of Logic Programming
Linear logic

ACM SIGACT News
Deciding provability of linear logic formulas

Proceedings of the workshop on Advances in linear logic
Plan reuse versus plan generation: a theoretical and empirical analysis

Artificial Intelligence - Special volume on planning and scheduling
Static analysis of linear logic programming

New Generation Computing
Partial structural synthesis of programs

Fundamenta Informaticae
Solving coverability problems of petri nets by partial deduction

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity

Mathematical Structures in Computer Science
Parallel program schemata

Journal of Computer and System Sciences
Solving planning problems by partial deduction

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning

Symbolic negotiation revisited

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Symbolic Negotiation in Linear Logic with Coalition Formation

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Enhancing commitment machines

DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies

Quantified Score

Hi-index	0.01

Visualization

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.