D.M. Gabbay. Labelled Deductive Systems, Oxford University Press, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Disjunction and Modular Goal-directed Proof Search - Stone (Correct)
....new world a that represents a generic possibility accessible from . The more general study of such sys tems has put them in a new proof theoretic perspective recently. They are closely related to semantics based translation systems [Ohlbach, 1991, Nonnengart, 1993] and labelled deductive systems [Gabbay, 1996, Basin et al. 1998] I use the term explicitly scoped from [Stone, 1999] because I continue to emphasize the extent to which the two formulations of reasoning represent the same inferences, just in different ways. The ability to define explicit scope is intimately connected with the ability to ....
Gabbay, D. M. (1996). Labelled Deductive Systems. Oxford.
Display Calculi for Nominal Tense Logics - Demri, Gore (Correct)
.... for intuitionistic logic in [Gor95] A Sahlqvist theorem for tense logics with the di#erence operator is given in [Ven93] but the calculi use the irreflexivity rule; see also [Rij93] Other general proof theoretical frameworks also exist for non classical logics: Labelled Deductive Systems [Gab96], Relational Proof Systems [Or#lo88, Or#lo91, Or#lo92] to quote two. But DL has already shown its generality since cut free display calculi have been defined for substructural logics [Res98, Gor98b, Gor98a] for modal and polymodal logics [Wan94, Kra96, Wan98] for intuitionistic logics [Gor95] ....
D. Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.
A Modular, Tactic-Based Approach to First-Order Temporal.. - Castellini, Smaill (2000) (Correct)
....modular approach to FOTLs in a labelled modal logic style comes from the consideration that most FOTLs share the same syntax and only differ in the underlying structure of time (linear, branching, discrete, continuous etc. Labelled deduction, in general, has recently become of great interest ( Gabbay, 1996 ] and we think it is worthwhile to investigate its applicability to temporal logics. Prolog is a sensible choice for implementing tactic based theorem provers for temporal logics ( Felty and Thery, 1996 ] The paper is structured as follows: Section 2 describes the sequent calculus T L; ....
....are several analogies between our framework and theirs: for instance, rule ENT in T L bears a strong resemblance with rule IR A in Russo s propositional modal labelled deductive system. All these attempts can be seen as a gradual shift towards Dov Gabbay s Labelled Deductive Systems framework ( Gabbay, 1996 ] in modal and temporal logic reasoning. The use of Prolog for theorem proving has been pioneered by Amy Felty ( Felty, 1993 ] who showed how the characteristics of this language made it perfectly suitable for implementing proof search through tactics and tacticals (respectively, what we ....
Dov M. Gabbay. Labelled Deductive Systems, Volume 1. Oxford University Press, Oxford, 1996.
Semantic Labelled Tableaux for Propositional BI - Galmiche, Méry (Correct)
....both logics, by some restrictions of the TBI calculus. Compared with other proof search methods, these new methods for these logics provide e cient proof search with an easy and direct generation of countermodels. Our results could be related to the Labelled Deductive Systems (LDS) methodology [10] where the deductive process manipulates labelled formulas and inference rules simultaneously act on formulas and labels. This approach has been used in order to build uniform deductive systems for a wide range of substructural logics [5, 7] From a set of labelled rules, that is the same for all ....
.... connectives in BI and even if it includes IL and MILL as subsystems, we cannot directly extend proof search (sequent, tableau, or connection) calculi de ned for both sublogics to BI [3, 11, 13, 36] We introduce labels and labelled formulas in a speci c way compared to the general LDS approach of [10] in order to de ne a labelled tableau calculus TBI , for propositional BI , with generation of countermodels. Let us start de ning this particular set of labels and constraints. 3.1 Labelled Tableaux De nition 3.1. A labelling language consists of the following symbols: a unit symbol 1, a ....
[Article contains additional citation context not shown here]
D.M. Gabbay. Labelled Deductive Systems, Volume I - Foundations. Oxford University Press, 1996.
Formalizing Belief Revision in Type Theory - Borghuis, Kamareddine, Nederpelt (Correct)
....Our type theoretical case study shows that explicitly represented justi cations have clear advantages: a number of drawbacks traditionally associated with foundational approaches disappear. As such, it may serve as a precursor to a more general account in the setting of Labelled Deductive Systems [15], of which typed calculi are a simple case. 2. It may contribute to a more computational account of belief revision, one which is applicable to agents that have nite information and nite reasoning powers. In developing the idea, we will come across other well known issues in this eld of ....
Gabbay, D., Labelled Deductive Systems. Oxford University Press.
Tableaux for Quantified Hybrid Logic - Patrick Blackburn And (2002) (Correct)
....# is a closed tableau beginning with s #, where s is a nominal not occurring in #. A key feature of our tableau is that all modal formulas occurring in a proof are grounded to a named world by their label. This same feature also occurs in labelled tableau for propositional modal logic [8, 7]. Grounding to a named state is implemented in our system by ensuring that all formulas occurring in proofs are of the form s # or s # for s a nominal. Thus the propositional rules become Conjunctive rules Disjunctive rules Negation rules To ....
D. Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.
A Connectionist Inductive Learning System For - Garcez, Gabbay (2002) Self-citation (Gabbay) (Correct)
No context found.
D. M. Gabbay. Labelled Deductive Systems. Clarendom Press.
The New Logic - Gabbay, Woods (2001) (1 citation) Self-citation (Gabbay) (Correct)
No context found.
Dov M. Gabbay. Label led Deductive Systems. Oxford: Oxford University Press, 1996.
Structured Contexts with Fibred Semantics - Dov Gabbay And (1997) (8 citations) Self-citation (Gabbay) (Correct)
No context found.
D. M. Gabbay. Labelled Deductive Systems, Part I. Oxford University Press, 1996.
The New Logic - Dov Gabbay Department (2001) (1 citation) Self-citation (Gabbay) (Correct)
No context found.
Dov M. Gabbay. Labelled Deductive Systems. Oxford: Oxford University Press, 1996.
On Epistemic Logic with Justification - Sergei Artemov Elena (Correct)
No context found.
D.M. Gabbay. Labelled Deductive Systems, Oxford University Press, 1994.
A Dependency-based Approach to Bounded & Unbounded Movement - Hepple (Correct)
No context found.
Gabbay, D.M. 1996. Labelled deductive systems. Volume I. Oxford University Press.
What is the Difference between Proofs and Programs? - Crossley (2005) (Correct)
No context found.
Dov Gabbay. Labelled deductive systems. Oxford University Press, 1996.
Samsara - Crossley (2005) (Correct)
No context found.
Dov Gabbay. Labelled deductive systems. Oxford University Press, 1996.
On Reasoning and Planning in Real-Time: An LDS-Based Approach - Asker, Malec (Correct)
No context found.
D. Gabbay, Labelled Deductive Systems, Vol. 1, Oxford University Press, 1996.
Defeasible Logic - Nute (2001) (56 citations) (Correct)
No context found.
D. Gabbay. Labelled Deductive Systems, volume 1. Oxford University Press, Oxford, 1996.
Tableaux + Constraints - Giese, Hähnle (2003) (Correct)
No context found.
Dov M. Gabbay. Labelled Deductive Systems, volume 1---Foundations. Oxford University Press, 1996.
On the Relative Complexity of Labelled Modal Tableaux - Governatori (2003) (Correct)
No context found.
Gabbay, D. M., "Labelled Deductive System," Oxford University Press, 1996.
Explicit Provability And Constructive Semantics - Artemov (2001) (1 citation) (Correct)
No context found.
D. M. Gabbay, Labelled deductive systems, Oxford University Press, 1994.
Functional Completeness for a Natural Deduction Formulation of.. - Braüner (Correct)
No context found.
D. Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.
Theorem Proving for Untyped Constructive λ-Calculus.. - Ramsay (2001) (Correct)
No context found.
D M Gabbay. Labelled deductive systems. Technical report, Dept. of Computing, Imperial College, 1989.
Theorem Proving for Untyped Constructive λ-Calculus.. - Ramsay (Correct)
No context found.
D M Gabbay. Labelled deductive systems. Technical report, Dept. of Computing, Imperial College, 1989.
Free-variable Tableaux for Propositional Modal Logics - Beckert, Goré (1997) (24 citations) (Correct)
No context found.
Dov Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.
Resource Tableaux (Extended Abstract) - Galmiche, Méry, Pym (Correct)
No context found.
D.M. Gabbay. Labelled Deductive Systems. OUP, 1996.
Multi-Context Argumentative Agents - Simon Parsons Carles (1998) (7 citations) (Correct)
No context found.
D. Gabbay. Labelled Deductive Systems. Oxford University Press, Oxford, UK, 1996.
First 50 documents Next 50
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