Advertisement

Belief increasing in SKL model frames

  • Matías Alvarado
  • Gustavo Núñez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 991)

Abstract

Three-Valued Strong Kleene Logic [16], provides an adequate framework to deal with belief increasing. In this paper, undefined truthvalue is used to denote opinionless information. Through an informative refinement, such information could become to be true or false in a step by step way. Our approach is based upon model frames [9], that are sets of informatively ordered three-valued interpretations. A relation of compatibility among frames, being a partial informative order, is defined. Belief increasing is accomplished by using the compatibility relation that is based on concatenation operation over model frames. A correspondence between model frames and analytic tableaux is outlined. It provides to deal with model frames by using that powerful proof method [11].

Keywords

Modal Logic Belief Change Model Frame Compatibility Relation Doxastic Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. Alchourron, P. Gärdenfors and D. Makinson: On the Logic of Theory Change: Partial Meet Contraction and Revision Function. Journal of Symbolic Logic. Vol. 50 (1985) 510–530.Google Scholar
  2. 2.
    M. Alvarado: A Posteriori Knowledge: from Ambiguous Knowledge and Undefined Information to Knowledge. In Ptocc. of ECSQARU '95 Lecture Notes in Artificial Intelligence 946. Fribourg, Switzerland (1995).Google Scholar
  3. 3.
    A. Avron: Natural 3-Valud Logics Characterization and Proof Systems. Journal of Symbolic Logic Vol. 56 No. 1, March 1991.Google Scholar
  4. 4.
    N. Belnap: A useful four-valued logic In Dunn and Epstein (Eds.) Modern Uses of Logic. Reidel Publishing Co, 1976.Google Scholar
  5. 5.
    Beckert: 3TAP Tableau-Based Theorem Prover. Karlsruhe University, Germany (1994)Google Scholar
  6. 6.
    G. Brewka and J. Hertzberg: How to do thing with worlds. Journal of Logic and Computation Vol No. (1993).Google Scholar
  7. 7.
    A. Del Val and Y. Shoham: A unified view of Belief Revision and Update. Journal of Logic and Computation Vol. 4 No. 5 pp 797–810 (1994)Google Scholar
  8. 8.
    S. Demri: Uniform and Non uniform Strategies for Tableaux Calculi for Modal Logic. In Procc. of Workshop on Logics in Artificial Intelligence JELIA'94, LNAI 738, Springer Verlag (1994)Google Scholar
  9. 9.
    P. Doherty, W. Lukasciewicz: NML3. A Non-Monotonic Logic with Explicit Defaults. Journal of Applied Non-Classical Logic Vol. 2 No. 1 (1992)Google Scholar
  10. 10.
    C. Geisler and K. Konolige: A resolution method for quantified modal logics of knowledfge and belief. In Procc of Reasoning About Knowledge Conference, (1986).Google Scholar
  11. 11.
    M. Fitting: First-Order Modal Tableaux. Journal of Automated Reasoning 4 (1988) pp. 191–213.CrossRefGoogle Scholar
  12. 12.
    P. Gärdenfors: Knowledge in Flux. The MIT Press (1988).Google Scholar
  13. 13.
    M. Ginsberg: Bilattices and Modal Operators.Google Scholar
  14. 14.
    J. Hintikka: Knowledge and Belief (Cornell University Press 1962).Google Scholar
  15. 15.
    H. Katsuno and A. Mendelzon Propositional knowledge base revision and minimal change. Artificial Intelligence 52 (1991) 263–294.CrossRefGoogle Scholar
  16. 16.
    S. Kleene: Introduction to Metamathematical. North Holland Ed. (1952)Google Scholar
  17. 17.
    K. Konolige: A Deduction Model of Belief and its Logics (Morgan Kaufmann, 1986).Google Scholar
  18. 18.
    S. Kripke: A completness theorem in modal logic. The Journal of Symbolic Logic. 24-1 (1959) pp. 1–14.Google Scholar
  19. 19.
    G. Núñez, M. Alvarado: An Approache to Belief in Strong Kleene Logic. Report de Recerca LSI-95-27, Technical University of Catalonia (1995)Google Scholar
  20. 20.
    N. Zabel: Nouvelles Techniques de Deduction Automatique en Logiques Polyvalentes Finies et Infinies du Premier Ordre, PhD Thesis. Institut National Polytechnique de Grenoble (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Matías Alvarado
    • 1
  • Gustavo Núñez
    • 2
  1. 1.LSITechnical University of CataloniaBarcelonaSpain
  2. 2.Integral Tecnology of InformationXalapa, Ver.México

Personalised recommendations