Matches in UGent Biblio for { ?s ?p 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.. }
Showing items 1 to 1 of
1
with 100 items per page.
- aggregation 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.".