Abstract
Negaid is posed as a plugin of a legal expert system shell, eGanges, which provides negotiation support for conflict prevention applications. A cohabitation contract application that uses an ontology of potential conflict demonstrates the negotiation logic of the expert system as seamless with the Negaid algorithm, a revised version of the Family Winner algorithm. The new negotiation algorithm incorporates the use and reuse of the cohabitation contract application until a list of differences can be identified for resolution as a matter of compromise. The list is then subjected to the Negaid algorithm, which assists in the negotiation process by suggesting trade-offs.
Original language | English |
---|---|
Title of host publication | Eleventh International Conference on Artificial Intelligence and Law |
Subtitle of host publication | proceedings, June 4-8, 2007, Stanford Law School, Stanford, California |
Editors | Radboud Winkels, Anne Gardner |
Place of Publication | New York |
Publisher | Association for Computing Machinery |
Pages | 247-252 |
Number of pages | 6 |
ISBN (Print) | 9781595936806 |
DOIs | |
Publication status | Published - 2007 |
Event | International Conference on Artificial Intelligence and Law (11th : 2007) - Stanford, California Duration: 4 Jun 2007 → 8 Jun 2007 |
Conference
Conference | International Conference on Artificial Intelligence and Law (11th : 2007) |
---|---|
City | Stanford, California |
Period | 4/06/07 → 8/06/07 |
Keywords
- dispute avoidance
- legal expert systems
- legal practitioner ontologies
- negotiation planning
- negotiation support systems