M. D'Agostino and M. Mondadori. The taming of the cut: Classical refutations with analytic cut. Journal of Logic and Computation, 4(3):285--319, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Tableau Methods for Modal and Temporal Logics - Goré (1995) (21 citations) (Correct)
....below encodes the law of the excluded middle but suffers the disadvantage that the new formulae P and :P are totally arbitrary, bearing no relationship to the numerator X . To use the (cut) rule we have to guess the correct P (although note that modal tableau systems based on Mondadori s system KE [DM94] can use cut sensibly) cut) X X ; P j X ; P The redundancy of the cut rule is therefore very desirable and can be proved in two ways. The first is to allow the cut rule and show syntactically Tableau Methods for Modal and Temporal Logics 19 that whenever there is a closed CL tableau for X ....
.... or Fitting [Fit83] Hence, as pointed out to me by Massacci, we may even be able to determine the complexity of the decision and satisfiability problems for K45 using this system, although such results are already known for most of the basic logics; see [Lad77, HM85] The system KE of Mondadori [DM94] has already been described in another chapter in this handbook. Clearly, it should be possible to extend all our modal tableau systems by modifying our tableau rules to incorporate the rule (PB) The only work along these lines that I know of is the work of Artosi, Governatori and coworkers ....
M. D'Agostino and M. Mondadori. The taming of the cut: classical refutations with analytic cut. Journal of Logic and Computation, 4:285--319, 1994.
Using tableaux to automate the Lambek and other Categorial Calculi - Luz (1998) (Correct)
....was supported by CNPq (Brazilian Research Council) Research Studentship No. 200210 93 9 2 Using tableaux to automate the Lambek and other Categorial Calculi 1 Background The assumption that Smullyan style tableau systems are adequate for automated deduction has been challenged recently in D Agostino and Mondadori (1994) for example on the basis that tableaux, as well as cut free Gentzen systems, exhibit three anomalies: 1) they fail to reflect the principle of bivalence (whose counterpart in Gentzen systems is the cut rule) 2) they are computationally expensive (not even being able to simulate truth tables ....
....the cut rule) 2) they are computationally expensive (not even being able to simulate truth tables in polynomial ) 3) they don t allow for nesting of subproofs (lemmas) thus leaving little room for heuristics which could mitigate computational complexity. In order to address these problems, D Agostino and Mondadori (1994) proposes a system, KE, where the tableau fi (tree branching) rules are replaced by linear rules plus a single branching one: a surgical cut. KE has been shown to be complete, more efficient than propositional tableaux, and more amenable to the implementation of heuristics. In D Agostino and ....
D'Agostino, M. and Mondadori, M. (1994). The taming of the cut: Classical refutations with analytic cut. Journal of Logic and Computation, 4:285--319.
Unrestricted vs Restricted Cut in a Tableau Method for .. - Järvisalo, Junttila.. (2004) (Correct)
No context found.
M. D'Agostino and M. Mondadori. The taming of the cut: Classical refutations with analytic cut. Journal of Logic and Computation, 4(3):285--319, 1994.
Unrestricted vs Restricted Cut in a Tableau Method for .. - Järvisalo, Junttila.. (2004) (Correct)
No context found.
M. D'Agostino and M. Mondadori. The taming of the cut: Classical refutations with analytic cut. Journal of Logic and Computation, 4(3):285--319, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC