We describe COBA 2.0, an implementation of a consistency-based framework for expressing belief change, focusing on revision and contraction (possibly) incorporating integrity constraints. This general framework was first proposed in [DS03], in which the authors argued that the revision and contraction operators satisfy most of the AGM postulates [AGM85] while being amenable to implementation. In this paper, following a review of the work of [DS03], we present COBA 2.0’s high-level algorithm, work through several examples, and discuss our experimental results. A distinguishing feature of COBA 2.0 is that it builds on SAT-technology by using a module comprising a state-of-the-art SATsolver for consistency checking.
James P. Delgrande, Daphne H. Liu, Torsten Schaub,