{"type":"ScholarlyArticle","title":"Negotiation Using Logic Programming with Consistency Restoring Rules","authors":[{"name":"Tran Cao Son","slug":"tran-cao-son","given":"Tran Cao","family":"Son","affiliation":""},{"name":"Chiaki Sakama","slug":"chiaki-sakama","given":"Chiaki","family":"Sakama","affiliation":""}],"abstract":"We formalize negotiations using logic programming with consistency restoring rules (or CRProlog) [Balduccini and Gelfond, 2003]. Our formulation deals with incomplete information, preferences, and changing goals. We assume that each agent is equipped with a knowledge base for negotiation which consists of a CR-program, a set of possible assumptions, and a set of ordered goals. We use the notion of an answer set as a means to formalize the basic notions of negotiation such as proposal, response, negotiation, negotiation tree (protocol), etc. and discuss their properties.Tran Cao Son, Chiaki Sakama","doi":null,"url":"https://ijcai.org/proceedings/2009/158","pdf":"https://ijcai.org/proceedings/2009/0158.pdf","markdown":"https://ijcai.org/proceedings/2009/158.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/158","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":158,"pages":{"first":930,"last":934},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}