Abstract
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 [1]; 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Delgrande, J., Schaub, T.: A consistency-based approach for belief change. Artificial Intelligence 151, 1–41 (2003)
Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet functions for contraction and revision. Journal of Symbolic Logic 50, 510–530 (1985)
Fuhrmann, A.: Relevant Logics, Modal Logics, and Theory Change. PhD thesis, Australian National University, Australia (1988)
Katsuno, H., Mendelzon, A.: On the difference between updating a knowledge base and revising it. In: Gärdenfors, P. (ed.) Belief Revision, pp. 183–203. Cambridge University Press, Cambridge (1992)
Kowalski, R.: Logic for data description. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, Plenum, pp. 77–103 (1978)
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)
Reiter, R.: Towards a logical reconstruction of relational database theory. In: Brodie, M., Mylopoulos, J., Schmidt, J. (eds.) On Conceptual Modelling, pp. 191–233. Springer, Heidelberg (1984)
A satisfiability library for java, http://www.sat4j.org
COBA 2.0, http://www.cs.sfu.ca/~cl/software/COBA/coba2.html90
Delgrande, J., Schaub, T., Tompits, H., Woltran, S.: On computing belief change operations using quantified boolean formulas. Journal of Logic and Computation 14, 801–826 (2004)
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)
Delgrande, J., Schaub, T.: Consistency-based approaches to merging knowledge bases. Journal of Applied Logics (to appear)
Benferhat, S., Kaci, S., Berre, D., Williams, M.A.: Weakening conflicting information for iterated revision and knowledge integration. Artificial Intelligence 153, 339–371 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delgrande, J.P., Liu, D.H., Schaub, T., Thiele, S. (2007). COBA 2.0: A Consistency-Based Belief Change System. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-75256-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75255-4
Online ISBN: 978-3-540-75256-1
eBook Packages: Computer ScienceComputer Science (R0)