COBA 2.0: A Consistency-Based Belief Change System
We describe COBA 2.0, an implementation of a consistency-based framework for expressing belief change, focusing here on revision and contraction, with the possible incorporation of integrity constraints. This general framework was first proposed in ; following a review of this work, we present COBA 2.0’s high-level algorithm, work through several examples, and describe our experiments. A distinguishing feature of COBA 2.0 is that it builds on SAT-technology by using a module comprising a state-of-the-art SAT-solver for consistency checking. As well, it allows for the simultaneous specification of revision, multiple contractions, along with integrity constraints, with respect to a given knowledge base.
Unable to display preview. Download preview PDF.
- 3.Fuhrmann, A.: Relevant Logics, Modal Logics, and Theory Change. PhD thesis, Australian National University, Australia (1988)Google Scholar
- 5.Kowalski, R.: Logic for data description. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, Plenum, pp. 77–103 (1978)Google Scholar
- 6.Sadri, F., Kowalski, R.: A theorem-proving approach to database integrity. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 313–362. MorganKaufmann, San Francisco (1987)Google Scholar
- 8.A satisfiability library for java, http://www.sat4j.org
- 11.Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified Boolean formulas. In: Proceedings of the AAAI National Conference on Artificial Intelligence, pp. 417–422 (2000)Google Scholar
- 12.Delgrande, J., Schaub, T.: Consistency-based approaches to merging knowledge bases. Journal of Applied Logics (to appear)Google Scholar