Advanced search
1 file | 110.98 KB

Modeling negotiation using multi-focused answer sets

Kim Bauters (UGent)
Author
Organization
Abstract
Answer Set Programming (ASP) is a form of declarative pro- gramming based on the stable model semantics. The idea of ASP is to represent a computational problem by a set of (propositional) rules P such that particular minimal models of P , the stable models, correspond to the solutions of the original problem. Communicating ASP (CASP) allows for a number of ASP programs to collaborate by asking each other questions. In CASP, there is no longer a unique way to define a stable model. Using a mechanism called focusing it becomes possible to elimi- nate some of these stable models, i.e. to assign preferences to the stable models of a CASP program. As a case study, this paper considers modeling a coalition formation as a CASP program. We then illustrate how, using multi-focused answer sets, we can impose constraints so that we can reach a unique agreement (stable model) that optimizes the preferences of the parties involved.
Keywords
logic programming, multi-agent, collaboration

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 110.98 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Bauters, Kim. 2011. “Modeling Negotiation Using Multi-focused Answer Sets.” In 2011 European Summer School in Logic, Language and Information : Student Session, Proceedings, 25–33.
APA
Bauters, Kim. (2011). Modeling negotiation using multi-focused answer sets. 2011 European Summer School in Logic, Language and Information : student session, proceedings (pp. 25–33). Presented at the 2011 European Summer School in Logic, Language and Information (ESSLLI 2011) : Student session.
Vancouver
1.
Bauters K. Modeling negotiation using multi-focused answer sets. 2011 European Summer School in Logic, Language and Information : student session, proceedings. 2011. p. 25–33.
MLA
Bauters, Kim. “Modeling Negotiation Using Multi-focused Answer Sets.” 2011 European Summer School in Logic, Language and Information : Student Session, Proceedings. 2011. 25–33. Print.
@inproceedings{1984113,
  abstract     = {Answer Set Programming (ASP) is a form of declarative pro- gramming based on the stable model semantics. The idea of ASP is to represent a computational problem by a set of (propositional) rules P such that particular minimal models of P , the stable models, correspond to the solutions of the original problem. Communicating ASP (CASP) allows for a number of ASP programs to collaborate by asking each other questions. In CASP, there is no longer a unique way to define a stable model. Using a mechanism called focusing it becomes possible to elimi- nate some of these stable models, i.e. to assign preferences to the stable models of a CASP program. As a case study, this paper considers modeling a coalition formation as a CASP program. We then illustrate how, using multi-focused answer sets, we can impose constraints so that we can reach a unique agreement (stable model) that optimizes the preferences of the parties involved.},
  author       = {Bauters, Kim},
  booktitle    = {2011 European Summer School in Logic, Language and Information : student session, proceedings},
  keyword      = {logic programming,multi-agent,collaboration},
  language     = {eng},
  location     = {Ljubljana, Slovenia},
  pages        = {25--33},
  title        = {Modeling negotiation using multi-focused answer sets},
  year         = {2011},
}