PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Consistency-based Revision of Structured Belief Bases

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this paper we extend a consistency-based approach (originally introduced by Delgrande and Schaub) to belief revision for structured belief bases. We explicitly distinguish between observations, i.e., facts that an epistemic agent observes or is being told, and rules representing general knowledge about the considered world. When new information becomes available respective sets are being altered in a different way to preserve parts of knowledge during the revision process. Such an approach allows us to deal with difficult and complex scenarios, involving defeasible information and derivation filtering, with common-sense results.
Wydawca
Rocznik
Strony
381--404
Opis fizyczny
Bibliogr. 35 poz.
Twórcy
autor
  • Faculty of Mathematics and Computer Science University of Warmia and Mazury, Olsztyn, Poland
  • Faculty of Mathematics and Computer Science University of Warmia and Mazury, Olsztyn, Poland
  • Institute of Informatics Warsaw University, Warsaw, Poland
Bibliografia
  • [1] C. Alchourron, P. Gardenfors and D. Makinson. On the Logic of Theory Change: Partial Meet Functions for Contraction and Revision. Journal of Symbolic Logic, 50:510-530, 1985.
  • [2] S. Benferhat, C. Cayrol, D. Dubois, J. Lang, H. Prade. Inconsistency Management and Prioritized Syntax-Based Entailment. IJCAI 1993, pp. 640-647, 1993.
  • [3] F. M. Brown. Boolean Reasoning. Kluwer Academic Publishers, 1990.
  • [4] M. Dalal. Investigations into a theory of knowledge base revision: Preliminary report. In Seventh national conference on artificial inteligence AAAI-88, 1988, 475-479
  • [5] J. Delgrande, D. Dubois, J. Lang. Iterated revision as prioritized merging. In Proceedings of KR’06, 2006, pp. 210-220
  • [6] J. Delgrande, T. Schaub. A Consistency-Based Approach for Belief Change. Artificial Intelligence Journal, 151, 1-2, 1-41, 2003.
  • [7] P. Di Gustio, G. Governatori. A new approach to base revision. In P. Barahona, J.J. Alferes, editors, Progress in Artificial Intelligence, Springer-Verlag, 1999, 327-341
  • [8] P. Doherty, W. Łukaszewicz, E. Madali´nska-Bugaj. The PMA and Relativizing Minimal Change for Action Update. Fundamenta Informaticae, 2000, 44(1-2), 95-131.
  • [9] P. Doherty, W. Łukaszewicz, A. Szałas. Computing Circumscription Revisited: A Reduction Algorithm. Journal of Automated Reasoning, 18, 1997, 297-336.
  • [10] D. Dubois, H. Prade. (1997) Focusing vs. Belief Revision: A Fundamental Distinction When Dealing with Generic Knowledge. Lecture Notes in Computer Science, 1244, pp 96-107.
  • [11] D. Dubois, H. Fargier, H. Prade. (2004) Ordinal and Probabilistic Representations of Acceptance. Journal of Artificial Intelligence Research, 22, pp. 23-56
  • [12] M.A. Falappa, A.J. Garcia, G. Kern-Isberner, G.R. Simari. Stratified Belief Bases Revision with Argumentative Inference. Journal of Philosophical Logic, 42, 2013, 161-193
  • [13] E. L. Ferm´e, S. O. Hansson. AGM25 Years - Twenty-Five Years of Research in Belief Change. J. Philosophical Logic, 40(2), 2011, 295-331.
  • [14] A. Fuhrmann. Theory contraction through base contraction. Journal of Philosophical Logic, 20, 1991, 175-203
  • [15] P. Gärdenfors. Belief revision: An Introduction. In: P. Gärdenfors (ed.) Belief revision, volume 29 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1992, 1-28. Electronic version: http://www.cs.sfu.ca/CourseCentral/823/jim/papers/gardenfors.pdf.
  • [16] S.O. Hansson. Revision of belief sets and belief bases. Handbook of Defeasible Reasoning and Uncertainty Management Systems, 1998, Volume 3, 17-75
  • [17] S. O. Hansson New operators for theory change, Theoria 55, 1989, 114132.
  • [18] S.O. Hansson. A dyadic representation of belief. In P. Gärdenfors, editor, Belief Revision. Cambridge tracts in theoretical computer science, 29. Cambridge University Press, 1992, 89-121.
  • [19] S. O. Hansen. Taking Belief Bases Seriously. Logic and Philosophy of Science in Uppsala Synthese Library. Vol. 236, 1994,13-28.
  • [20] S.O. Hansson. Ten Philosophical Problems in Belief Revision. Journal of Logic and Computation, 2003, 18(1), 37-49
  • [21] S.O. Hansson. Logic of belief revision. In E. N. Zalta, editor, The stanford encyclopedia of philosophy. Stanford University, 2006
  • [22] R. Kahle. Structured belief bases. Logic and Logical Philosophy, 10, 2002, 45-58.
  • [23] H. Katsuno, A. O. Mendelzon. A Unified View of Propositional Knowledge Base Updates. Proceedings of the 11th International Joint Conference on Artificial Intelligence, 1989, 1413-1419.
  • [24] H. Katsuno, A. O. Mendelzon. On the Difference between Updating a knowledge base and revising it. In P. G rdenfors, editor, Belief Revision. Cambridge University Press, 1992, 183-203.
  • [25] F. Lin, R. Reiter. Forget It! Proceedings of the AAAI Fall Symposiumon Relevance, 1994, 154-159. Electronic version: http://www.cs.toronto.edu/kr/papers/forgetting.pdf
  • [26] E. Madalińska-Bugaj, W. Łukaszewicz. Belief Revision Revisited. Proceedings of the 4th Mexican International Conference on Artificial Intelligence, Lecture Notes in Computer Science, Springer, 2005, 31-40.
  • [27] E. Madalińska-Bugaj, W. Łukaszewicz. First-order Generalization of the MPMA Belief Update Operator. Fundamenta Informaticae, 94, 49-61, 2009.
  • [28] Y. Moses, Y. Shoham,. Belief as Defeasible Knowledge. Proceedings of the 11th International Joint Conference on Artificial Intelligence, 1989, 1168-1173. (Extended version in Artificial Intelligence Journal, 64(2), 1993, 299-321.)
  • [29] D. Nute. Defeasible logic. In Handbook of logic in artificial intelligence and logic programming, Volume 3. Oxford University Press. 1994, 353-395
  • [30] B. Nebel. Syntax-based approaches of belief revision. In P. G¨ardenfors, editor, Belief Revision. Cambridge University Press, 1992, 52-88
  • [31] P. Peppas. Belief Revision. In: F. van Harmelen, V. Lifschitz and B. Porter (eds.), Handbook of Knowledge Representation, Elsevier, 2008.
  • [32] D. Perlis. On the Consistency of Common-Sense Reasoning. /em Computational Intelligence, 2, 1987, 180-190.
  • [33] R. Reiter, G. Criscuolo. On Interacting Defaults. Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981, 270-276.
  • [34] R. Reiter, G. Criscuolo. Some Representational Issues in Default Reasoning. International Journal of Computers and Mathematics, 9, 1983, 1-9.
  • [35] K. Satoh. K. Nonmonotonic reasoning by minimal belief revision. Proceedings of the International Conference on Fifth Generation Computer Systems, 1988, 455-462.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-1b2f1536-2808-4383-99ba-e83001087059
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.