D. M. Gabbay and G. Governatori. Fibred modal tableaux. In D. Basin, M. D'Agostino, D. Gabbay, S. Matthews, and L. Vigano, editors, Labelled Deduction, volume 17 of Applied Logic Series, pages 163--194. Kluwer, Dordrecht, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....systems which provides us with a suitable basis for defining their fibring, and which subsumes our previous work as a simple special case. The problem of combining logics has been attracting much attention, and our work was inspired by the pioneering research on fibring by Gabbay and colleagues [5, 9, 12, 15, 17, 18, 20]. For example, in [5] Gabbay and Beckert first identify the conditions that allow tableaux systems to be well suited for fibring, and then provide a sound and complete system for the fibring of two logics passing from tableaux of one component to tableaux of the other, and vice versa. Along the ....

....Gabbay and Beckert first identify the conditions that allow tableaux systems to be well suited for fibring, and then provide a sound and complete system for the fibring of two logics passing from tableaux of one component to tableaux of the other, and vice versa. Along the same line of work, in [20] Gabbay and Governatori use fibring as a way to combine modal logics presented using the labelled tableaux system KEM; they adapt KEM in order to obtain a modular and flexible tableaux like proof method for the multi modal logics arising from the fibring of modal logics. We believe that our ....

G. Governatori and D. M. Gabbay. Fibred modal tableaux. In Basin et al. [2].

....systems which provides us with a suitable basis for de ning their bring, and which subsumes our previous work as a simple special case. The problem of combining logics has been attracting much attention, and our work was inspired by the pioneering research on bring by Gabbay and colleagues [5, 9, 12, 15, 17, 18, 20]. For example, in [5] Gabbay and Beckert rst identify the conditions that allow tableaux systems to be wellsuited for bring, and then provide a sound and complete system for the bring of two logics passing from tableaux of one component to tableaux of the other, and vice versa. Along the same ....

....[5] Gabbay and Beckert rst identify the conditions that allow tableaux systems to be wellsuited for bring, and then provide a sound and complete system for the bring of two logics passing from tableaux of one component to tableaux of the other, and vice versa. Along the same line of work, in [20] Gabbay and Governatori use bring as a way to combine modal logics presented using the labelled tableaux system KEM; they adapt KEM in order to obtain a modular and exible tableaux like proof method for the multi modal logics 40 arising from the bring of modal logics. We believe that our ....

G. Governatori and D. M. Gabbay. Fibred modal tableaux. In Basin et al. [2].

No context found.

D. M. Gabbay and G. Governatori. Fibred modal tableaux. In D. Basin, M. D'Agostino, D. Gabbay, S. Matthews, and L. Vigano, editors, Labelled Deduction, volume 17 of Applied Logic Series, pages 163--194. Kluwer, Dordrecht, 2000.

No context found.

D. M. Gabbay and G. Governatori. Fibred modal tableaux. In D. Basin, M. D'Agostino, D. Gabbay, S. Matthews, and L. Vigan o, editors, Labelled Deduction, volume 17 of Applied Logic Series, pages 163--194. Kluwer, Dordrecht, 2000.

No context found.

Gabbay, D. M. and G. Governatori, Fibred modal tableaux, in: D. Basin, M. D'Agostino, D. Gabbay, S. Matthews and L. Vigano, editors, Labelled Deduction, Applied Logic Series 17, Kluwer, Dordrecht, 2000 pp. 163--194.

....a key feature of LDSs is worth mentioning. LDSs are in general very sensitive to the various features of different logics so that differently motivated and formulated logics can very often be combined in a simple and natural way provided we have a suitable LDS formulation for them (see, e.g. [21, 22, 4]) In LDSs the usual modal semantics is incorporated in the syntactic label construction and only minor variations are needed to pass from one logic to another [1, 4, 21, 22, 25, 5, 36, 40] Thus, once an automated LDS is available for some appropriate modal systems, only slight natural changes in ....

.... logics can very often be combined in a simple and natural way provided we have a suitable LDS formulation for them (see, e.g. 21, 22, 4] In LDSs the usual modal semantics is incorporated in the syntactic label construction and only minor variations are needed to pass from one logic to another [1, 4, 21, 22, 25, 5, 36, 40]. Thus, once an automated LDS is available for some appropriate modal systems, only slight natural changes in the modal LDS are needed to yield the appropriate semantics for CLs and nonmonotonic consequence relations. More precisely, we use a labelled tableau system, called KEM, suitable for a ....

[Article contains additional citation context not shown here]

Dov M. Gabbay and Guido Governatori. Fibred modal tableaux. In D. Basin, pages 163--194. Kluwer, Dordrecht, 2000.

....with the appropriate labels in the branch (tree) j (PNC) if [i, j]# B . The rule PNC (Principle of Non Contradiction) states that two labelled formulas are # B complementary when the two formulas are complementary and their labels # B unify. For detailed accounts of KEM see [1, 8, 9]. 2.3 Single Step Tableaux (SST) Single Step Tableaux [12] originate from and add modularity to Fitting s prefix tableaux [6] The free variable version we shall focus on here has been proposed by Beckert and Gore [2] The basic idea of SST is that (modal) formulas are used to move the ....

Dov M. Gabbay and Guido Governatori. Fibred modal tableaux. In David Basin, Marcello D'Agostino, Dov Gabbay, Sean Matthews, and Luca Vigano, editors, Labelled Deduction, volume 17 of Applied Logic Series, pages 163--194. Kluwer, Dordrecht, 1999.

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