Defeasible Reasoning between Conflicting Agents Based on VALPSN

Contents

We propose a method to model agents’ scedules aiming to resolve conflicts between agents based on the defeasible reasoning by VALPSN(Vector Annotated Logic Program with Strong Negation). In the method, first, agents’ shedules are defined by Billington’s defeasible theories. The defeasible theories are translated into VALPSNs as the next step and the VALPSNs’ stable models are computed as the last step. We describe how to translate the Billington’s defeasible theories into VALPSNs and how to proceed the negotiation to resolve conflicts between a meeting cordinator and agents taking an appointment scedule problem as an example.