论文信息 - Approximations of Modal Logic K

Approximations of Modal Logic K

Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This procedure has a clear semantics and a natural proof theory in the context of Massacci's modal Single Step Tableaux (SST).

Marcelo Finger | Guilherme de Souza Rabello | M. Finger

[1] Fabio Massacci,et al. Single Step Tableaux for Modal Logics , 2000, Journal of Automated Reasoning.

[2] M. Fitting. Proof Methods for Modal and Intuitionistic Logics , 1983 .

[3] Marcelo Finger. Polynomial Approximations of Full Propositional Logic via Limited Bivalence , 2004, JELIA.

[4] Fabio Massacci. Anytime Approximate Modal Reasoning , 1998, AAAI/IAAI.

[5] Silvio Ghilardi,et al. An Algebraic Theory of Normal Forms , 1995, Ann. Pure Appl. Log..

[6] George Boole,et al. An Investigation of the Laws of Thought: Frontmatter , 2009 .

[7] Marcelo Finger,et al. Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control , 2004, J. Log. Comput..

[8] R. Goodstein. FIRST-ORDER LOGIC , 1969 .

[9] Fabio Massacci,et al. Anytime approximate model reasoning , 1998, AAAI 1998.

[10] Marco Schaerf,et al. Tractable Reasoning via Approximation , 1995, Artif. Intell..

[11] Max J. Cresswell,et al. A New Introduction to Modal Logic , 1998 .