�Ö��ÓÖ � Å�ÒØ× �Û � ÇÖÐÓÛ×��

This paper formalizes belief revision for belief states in type theory. Type theory has been influential in logic and computer science but as far as we know, this is the first account at using type theory in belief revision. The use of type theory allows an agent's beliefs as well as his justifications for these beliefs to be explicitly represented and hence to act as first-class citizens. Treating justifications as first-class citizens allows for a deductive perspective on belief revision. We propose a procedure for identifying and removing "suspect" beliefs, and beliefs depending on them. The procedure may be applied iteratively, and terminates in a consistent belief state. The procedure is based on introducing explicit justification of beliefs. We study the belief change operations emerging from this perspective in the setting of typed lambda-calculus, and situate these operations with respect to standard approaches.

[1]  Peter F. Patel-Schneider,et al.  The Generation of DAML+OIL , 2001, Description Logics.

[2]  Volker Haarslev,et al.  The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach , 2000, IJCAR.

[3]  C. Lutz.  The Complexity of Reasoning with Concrete Domains , 1999 .

[4]  Anthony G. Cohn,et al.  A Spatial Logic based on Regions and Connection , 1992, KR.

[5]  Carsten Lutz.  NEXPTIME-Complete Description Logics with Concrete Domains , 2001, IJCAR.

[6]  Carsten Lutz.  Interval-based Temporal Reasoning with General TBoxes , 2001, IJCAI.

[7]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

[8]  Mitchell Wand.  Correctness of Procedure Representations in Higher-Order Assembly Language , 1991, MFPS.

[9]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[10]  Olivier Danvy,et al.  For a Better Support of Static Data Flow , 1991, FPCA.

[11]  Franz Baader,et al.  A Terminological Knowledge Representation System with Complete Inference Algorithms , 1991, PDK.

[12]  Chetan R. Murthy.  Extracting Constructive Content From Classical Proofs , 1990 .

[13]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[14]  John C. Reynolds,et al.  The discoveries of continuations , 1993, LISP Symb. Comput..

[15]  Ian Horrocks,et al.  Ontology Reasoning in the SHOQ(D) Description Logic , 2001, IJCAI.

[16]  Jochen Renz,et al.  A Canonical Model of the Region Connection Calculus , 1997, J. Appl. Non Class. Logics.

[17]  Maurizio Lenzerini,et al.  TBox and ABox Reasoning in Expressive Description Logics , 1996, KR.

[18]  Albert R. Meyer,et al.  Continuation Semantics in Typed Lambda-Calculi (Summary) , 1985, Logic of Programs.

[19]  Amr Sabry,et al.  Is continuation-passing useful for data flow analysis? , 1994, PLDI '94.

[20]  Franz Baader,et al.  Extensions of Concept Languages for a Mechanical Engineering Application , 1992, GWAI.

[21]  Krister Segerberg,et al.  Modal logics with functional alternative relations , 1986, Notre Dame J. Formal Log..

[22]  Flemming Nielson.  A denotational framework for data flow analysis , 2004, Acta Informatica.

[23]  Marcus Kracht,et al.  Highway to the Danger Zone , 1995, J. Log. Comput..

[24]  Fabio Bellissima,et al.  On the lattice of extensions of the modal logics KAltn , 1988, Arch. Math. Log..

[25]  Carsten Lutz,et al.  Concrete domains and nominals united , 2002 .

[26]  Amr Sabry,et al.  Reasoning about programs in continuation-passing style , 1992, LFP '92.

[27]  Ian Horrocks,et al.  Evaluating a Modular Abox Algorithm , 2002, KR.

[28]  Peter Sestoft,et al.  Partial evaluation and automatic program generation , 1993, Prentice Hall international series in computer science.

[29]  Christopher Strachey,et al.  Continuations: A Mathematical Semantics for Handling Full Jumps , 2000, High. Order Symb. Comput..

[30]  Mitchell Wand,et al.  Embedding type structure in semantics , 1985, POPL.

[31]  Andrew C. Myers,et al.  Secure Information Flow and CPS , 2001, ESOP.

[32]  Andrew W. Appel,et al.  Compiling with Continuations , 1991 .

[33]  Geoffrey L. Burn,et al.  Continuation Passing Transformation and Abstract Interpretation , 1993, Theory and Formal Methods.

[34]  W. Nutt,et al.  Subsumption algorithms for concept languages , 1990 .

[35]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[36]  Peter F. Patel-Schneider,et al.  Living wiht Classic: When and How to Use a KL-ONE-Like Language , 1991, Principles of Semantic Networks.

[37]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[38]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[39]  Paul Hudak,et al.  ORBIT: an optimizing compiler for scheme , 1986, SIGPLAN '86.

[40]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[41]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[42]  Jens Palsberg,et al.  CPS transformation of flow information , 2003, J. Funct. Program..

[43]  Philipp Hanschke,et al.  Specifying Role Interaction in Concept Languages , 1992, KR.

[44]  Enrico Franconi,et al.  A Temporal Description Logic for Reasoning about Actions and Plans , 1998, J. Artif. Intell. Res..

[45]  Amr Sabry,et al.  Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW'01) , 2001 .

[46]  Bernhard Nebel,et al.  On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus , 1999, Artif. Intell..

[47]  Dov M. Gabbay,et al.  Products of Modal Logics, Part 1 , 1998, Log. J. IGPL.

[48]  Brandon Bennett,et al.  Modal Logics for Qualitative Spatial Reasoning , 1996, Log. J. IGPL.

[49]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[50]  Carsten Lutz.  Adding Numbers to the SHIQ Description Logic: First Results , 2002, KR.

[51]  Olivier Danvy,et al.  Continuation-based partial evaluation , 1994, LFP '94.

[52]  Volker Haarslev,et al.  A Concept Language with Role-Forming Predicate Restrictions , 1998 .

[53]  Jr. Guy L. Steele,et al.  Rabbit: A Compiler for Scheme , 1978 .

[54]  Andrea Schaerf,et al.  On the complexity of the instance checking problem in concept languages with existential quantification , 1993, Journal of Intelligent Information Systems.

[55]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[56]  Carsten Lutz,et al.  Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies , 2002, Description Logics.

[57]  Philip Wadler,et al.  A reflection on call-by-value , 1997, TOPL.

[58]  François Rousselot,et al.  A Description Logic Model for Reacting in a Dynamic Environment , 2000, Description Logics.

[59]  Peter Lee,et al.  Safe-for-Space Threads in Standard ML , 1998, High. Order Symb. Comput..

[60]  Carsten Lutz,et al.  PSpace Reasoning with the Description Logic ALCF(D) , 2002, Logic Journal of the IGPL.

[61]  Carsten Lutz,et al.  A Correspondence between Temporal Description Logics , 2004, J. Appl. Non Class. Logics.

[62]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[63]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[64]  John C. Reynolds.  Definitional Interpreters for Higher-Order Programming Languages , 1998, High. Order Symb. Comput..

[65]  Jens Palsberg,et al.  Object-oriented type inference , 1991, OOPSLA '91.

[66]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[67]  Anders Bondorf,et al.  Improving binding times without explicit CPS-conversion , 1992, LFP '92.

[68]  Carsten Lutz,et al.  Description Logics with Concrete Domains-A Survey , 2002, Advances in Modal Logic.

[69]  Mitchell Wand,et al.  Continuation-Based Program Transformation Strategies , 1980, JACM.

[70]  Francesco M. Donini,et al.  Deduction in Concept Languages: From Subsumption to Instance Checking , 1994, J. Log. Comput..

[71]  Franz Baader,et al.  Tableau Algorithms for Description Logics , 2000, TABLEAUX.

[72]  Suresh Jagannathan,et al.  A unified treatment of flow analysis in higher-order languages , 1995, POPL '95.

[73]  M. Kracht.  Tools and Techniques in Modal Logic , 1999 .

[74]  Flemming Nielson,et al.  Infinitary control flow analysis: a collecting semantics for closure analysis , 1997, POPL '97.