论文信息 - Approximate reasoning in strength logic

Approximate reasoning in strength logic

The author defines a modal logic SL (strength logic) to reason about beliefs in an AI system. SL is a refinement of J. Halpern and M. Rabin's likelihood logic (LL) (1987). As in LL, the powers of a modal operator S are used in SL to denote various degrees of certainty of beliefs. However, the axiomatization of SL is different from that of LL. Formulas in SL admit normal forms, and decision procedures of SL can be effectively constructed. The author defines a model of SL as an extension of Herbrand models for the propositional logic. This interpretation of SL is sharply different from the conventional semantics of modal logics. The thrust behind this research is to provide a natural and rigorous logic for designing, implementing, and verifying AI systems capable of approximate reasoning.<<ETX>>

Hantao Zhang

[1] Drew McDermott,et al. Nonmonotonic Logic II: Nonmonotonic Modal Theories , 1982, JACM.

[2] Joseph Y. Halpern,et al. Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[3] Richard E. Ladner,et al. Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[4] Peter C. Cheeseman,et al. In Defense of Probability , 1985, IJCAI.

[5] Gregory L. McArthur,et al. Reasoning about knowledge and belief: a survey , 1988, Comput. Intell..

[6] Rohit Parikh,et al. An Elementary Proof of the Completness of PDL , 1981, Theor. Comput. Sci..

[7] Joseph Y. Halpern,et al. A Logic to Reason about Likelihood , 1987, Artif. Intell..

[8] Nils J. Nilsson,et al. Probabilistic Logic * , 2022 .

[9] Rolf Stachowitz,et al. Building validation tools for knowledge-based systems , 1987 .

[10] Joseph Y. Halpern,et al. Likelihood, probability, and knowledge 1 , 1984, AAAI.

[11] William McCune,et al. OTTER 1.0 Users' Guide , 1990 .