Partial Deduction for Linear Logic—The Symbolic Negotiation Perspective

Küngas, Peep; Matskin, Mihhail

doi:10.1007/11493402_3

Cited by 5 publications

(8 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is extended with negotiation-specific rules. The underlying CPS formalism was previously presented in [3]. Here we extend the results and position symbolic negotiation according to other distributed problem solving mechanisms.…”

mentioning

confidence: 67%

“…Most of the definitions in this section are from [3], where they were used to define a CPS formalism. The presented rules have to read in bottom-up manner.…”

Section: Partial Deductionmentioning

confidence: 99%

“…In [3] a formalisation of PD for LL was presented and its soundness and completeness was proved. The paper regarded symbolic negotiation as interleaved cooperative problem solving (CPS) and plan modification.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Symbolic negotiation revisited

Küngas

Matskin

2006

Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems

Self Cite

View full text Add to dashboard Cite

show abstract

mentioning

confidence: 67%

“…Most of the definitions in this section are from [3], where they were used to define a CPS formalism. The presented rules have to read in bottom-up manner.…”

Section: Partial Deductionmentioning

confidence: 99%

See 1 more Smart Citation

Symbolic negotiation revisited

Küngas

Matskin

2006

Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…We have previously formalised [3] PD for LL and proven its soundness and completeness. However, the applicability of PD is relatively limited without domain-dependent heuristics.…”

Section: Partial Deduction and Gap Detectionmentioning

confidence: 99%

“…We have also proposed a formalism [3] for partial deduction (PD) in LL, an architecture and process description for automated Web service composition [9] and a formalism [3] for facilitating interactive composition. In this paper we enhance these results for analysis of existing Web service descriptions.…”

Section: Introductionmentioning

confidence: 99%

Detection of Missing Web Services: The Partial Deduction Approach

Küngas

Matskin

International Conference on Next Generation Web Services Practices (NWeSP'05)

View full text Add to dashboard Cite

Many methods have been recently proposed for composing automatically Web services from existing ones. The methods range from AI planning to automated theorem proving and graph search algorithms. However, the usability of these methods is greatly affected by two assumptions. Firstly, it is assumed that developers provide consistent declarative descriptions of Web services. Secondly, it is assumed that there exists a sufficient set of atomic Web services, which would facilitate the composition of all other Web services. In this paper we propose a method to ensure these two assumptions by using analysis of Web services' descriptions. In particular, we apply partial deduction for identifying possible inconsistencies in Web service descriptions. Our method also determines possibly missing atomic Web services, which should be implemented in order to compose a requested composite Web service.

show abstract

Enhancing Commitment Machines

Winikoff

Liu

Harland

2005

Declarative Agent Languages and Technologies II

View full text Add to dashboard Cite

Agent interaction protocols are usually specified in terms of permissible sequences of messages. This representation is, unfortunately, brittle and does not allow for flexibility and robustness. The commitment machines framework of Yolum and Singh aims to provide more flexibility and robustness by defining interactions in terms of the commitments of agents. In this paper we identify a number of areas where the commitment machines framework needs improvement and propose an improved version. In particular we improve the way in which commitments are discharged and the way in which pre-conditions are specified.

show abstract

Partial Deduction for Linear Logic—The Symbolic Negotiation Perspective

Cited by 5 publications

References 17 publications

Symbolic negotiation revisited

Symbolic negotiation revisited

Detection of Missing Web Services: The Partial Deduction Approach

Enhancing Commitment Machines

Contact Info

Product

Resources

About