×

Relevance sensitive non-monotonic inference on belief sequences. (English) Zbl 1041.68093

Summary: We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the putative conclusion and formulas in the sequence. The relevance relations are ternary (using context as a parameter) as opposed to standard binary axiomatizations. The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs. In doing so, it provides a finitely presented formalism and a plausible model of reasoning for automated agents.

MSC:

68T27 Logic in artificial intelligence
68T30 Knowledge representation
03B42 Logics of knowledge and belief (including belief change)
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] DOI: 10.2307/2274239 · Zbl 0578.03011 · doi:10.2307/2274239
[2] Arlo-Costa Horacio, Proceedings of the Twelfth Amsterdam Colloquium · Zbl 0726.03021
[3] Brewka Gerhard, The Logic of Theory Change 465 pp 206– (1991) · Zbl 0753.03011 · doi:10.1007/BFb0018422
[4] Chopra Samir, Proceedings of the 16th International Joint Conference on Artificial Intelligence pp 192–
[5] Chopra Samir, Annals of Mathematics and Artificial Intelligence 28 (1) pp 259– (2000) · Zbl 1001.68095 · doi:10.1023/A:1018960323808
[6] Darwiche Adnan, Artificial Intelligence 89 (1) pp 1– (1997) · Zbl 1018.03012 · doi:10.1016/S0004-3702(96)00038-0
[7] DOI: 10.1016/0004-3702(79)90008-0 · doi:10.1016/0004-3702(79)90008-0
[8] Epstein Richard, The Semantical Foundations of Logic: Propositional Logics (1995)
[9] Freund Michael, Belief revision and rational inference (1994)
[10] Gärdenfors P., Proceedings of Theoretical Aspects of Reasoning about Knowledge–TARK88 pp 83–
[11] Gärdenfors P., Handbook of Logic in Artificial Intelligence and Logic Programming, Volume IV: Epistemic and Temporal Reasoning pp 35– (1995) · Zbl 0819.03010
[12] Georgatos Konstantinos, Logics in Artificial Intelligence (JELIA ’96) pp 176– (1996) · doi:10.1007/3-540-61630-6_12
[13] Georgatos Konstantinos, Proceedings of ESCQARU/FAPR 97 1244 pp 282–
[14] Hansson Sven Ove, Synthese 91 pp 239– (1992) · Zbl 0760.03009 · doi:10.1007/BF00413568
[15] DOI: 10.1016/S0004-3702(99)00072-7 · Zbl 0939.68852 · doi:10.1016/S0004-3702(99)00072-7
[16] Lehmann Daniel, Proceedings of the 14th International Joint Conference on Artificial Intelligence pp 1534–
[17] Nayak Abhaya, Proceedings of Theoretical Aspects of Rationality and Knowledge-TARK96 pp 119–
[18] Nebel Bernhard, Belief revision, Cambridge Tracts in Theoretical Computer Science (1992) · Zbl 0709.68091
[19] Parikh Rohit, Logic, Language and Computation, Volume 2 pp 266– (1999)
[20] Rodrigues Odinaldo, A methodology for iterated information change (1997)
[21] Ryan Mark D., Proceedings of the 8th Amsterdam Colloquium
[22] Wassermann Renata, Erkenntnis (1999)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.