Results 1  10
of
13
Internalizing Labelled Deduction
 Journal of Logic and Computation
, 2000
"... This paper shows how to internalize the Kripke satisfaction denition using the basic hybrid language, and explores the proof theoretic consequences of doing so. As we shall see, the basic hybrid language enables us to transfer classic Gabbaystyle labelled deduction methods from the metalanguage to ..."
Abstract

Cited by 74 (20 self)
 Add to MetaCart
This paper shows how to internalize the Kripke satisfaction denition using the basic hybrid language, and explores the proof theoretic consequences of doing so. As we shall see, the basic hybrid language enables us to transfer classic Gabbaystyle labelled deduction methods from the metalanguage to the object language, and to handle labelling discipline logically. This internalized approach to labelled deduction links neatly with the Gabbaystyle rules now widely used in modal Hilbertsystems, enables completeness results for a wide range of rstorder denable frame classes to be obtained automatically, and extends to many richer languages. The paper discusses related work by Jerry Seligman and Miroslava Tzakova and concludes with some reections on the status of labelling in modal logic. 1 Introduction Modern modal logic revolves around the Kripke satisfaction relation: M;w ': This says that the model M satises (or forces, or supports) the modal formula ' at the state w in M....
Cutfree Display Calculi for Nominal Tense Logics
 Conference on Tableaux Calculi and Related Methods (TABLEAUX
, 1998
"... . We define cutfree display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use a translation of MNTL into the minimal tense logic of inequality (MTL 6= ) which is known to be properly displayable by application of Krac ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
. We define cutfree display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use a translation of MNTL into the minimal tense logic of inequality (MTL 6= ) which is known to be properly displayable by application of Kracht's results. The rules of the display calculus ffiMNTL for MNTL mimic those of the display calculus ffiMTL 6= for MTL 6= . Since ffiMNTL does not satisfy Belnap's condition (C8), we extend Wansing's strong normalisation theorem to get a similar theorem for any extension of ffiMNTL by addition of structural rules satisfying Belnap's conditions (C2)(C7). Finally, we show a weak Sahlqviststyle theorem for extensions of MNTL, and by Kracht's techniques, deduce that these Sahlqvist extensions of ffiMNTL also admit cutfree display calculi. 1 Introduction Background: The addition of names (also called nominals) to modal logics has been investigated recently with different motivations; see...
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
, 1999
"... . We define sequentstyle calculi for nominal tense logics characterized by classes of modal frames that are firstorder definable by certain \Pi 0 1 formulae and \Pi 0 2 formulae. The calculi are based on d'Agostino and Mondadori's calculus KE and therefore they admit a restricted cutrule ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
. We define sequentstyle calculi for nominal tense logics characterized by classes of modal frames that are firstorder definable by certain \Pi 0 1 formulae and \Pi 0 2 formulae. The calculi are based on d'Agostino and Mondadori's calculus KE and therefore they admit a restricted cutrule that is not eliminable. A nice computational property of the restriction is, for instance, that at any stage of the proof, only a finite number of potential cutformulae needs to be taken under consideration. Although restrictions on the proof search (preserving completeness) are given in the paper and most of them are theoretically appealing, the use of those calculi for mechanization is however doubtful. Indeed, we present sequent calculi for fragments of classical logic that are syntactic variants of the sequent calculi for the nominal tense logics. 1 Introduction Background. The nominal tense logics are extensions of Prior tense logics (see e.g. [Pri57, RU71]) by adding nomina...
Bringing them all Together
, 2001
"... this paper, Jerry Seligman takes us on an interesting journey. The satisfaction denition of most modal operators is specied in terms of rstorder conditions. Hence we can always obtain a complete calculus for the basic logic characterizing any collection of such operators by appealing to a calculus ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
this paper, Jerry Seligman takes us on an interesting journey. The satisfaction denition of most modal operators is specied in terms of rstorder conditions. Hence we can always obtain a complete calculus for the basic logic characterizing any collection of such operators by appealing to a calculus which is complete for the full rstorder language. Seligman shows here that by making use of the expressiveness provided by the hybrid apparatus, we can, step by step, transform a rstorder sequent calculus into an internalized sequent calculus specically tailored for a particular hybrid fragment
Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto
 Logic Journal of IGPL
, 2000
"... This paper is about the good side of modal logic, the bad side of modal logic, and how hybrid logic takes the good and xes the bad. In essence, modal logic is a simple formalism for working with relational structures (or multigraphs) . But modal logic has no mechanism for referring to or reasoning ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This paper is about the good side of modal logic, the bad side of modal logic, and how hybrid logic takes the good and xes the bad. In essence, modal logic is a simple formalism for working with relational structures (or multigraphs) . But modal logic has no mechanism for referring to or reasoning about the individual nodes in such structures, and this lessens its eectiveness as a representation formalism. In their simplest form, hybrid logics are upgraded modal logics in which reference to individual nodes is possible. But hybrid logic is a rather unusual modal upgrade. It pushes one simple idea as far as it will go: represent all information as formulas. This turns out to be the key needed to draw together a surprisingly diverse range of work (for example, feature logic, description logic and labelled deduction) . Moreover, it displays a number of knowledge representation issues in a new light, notably the importance of sorting. Keywords: Labelled deduction, description logic, f...
Display Calculi for Logics with Relative Accessibility Relations
, 1998
"... We define cutfree display calculi for knowledge logics where an indiscernibility relation is associated to each set of agents, and where agents decide the membership of objects using this indiscernibility relation. To do so, we first translate the knowledge logics into polymodal logics axiomatised ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We define cutfree display calculi for knowledge logics where an indiscernibility relation is associated to each set of agents, and where agents decide the membership of objects using this indiscernibility relation. To do so, we first translate the knowledge logics into polymodal logics axiomatised by primitive axioms and then use Kracht's results on properly displayable logics to define the display calculi. Apart from these technical results, we argue that Display Logic is a natural framework to define cutfree calculi for many other logics with relative accessibility relations. This paper has not been submitted elsewhere in identical or similar form Visit to A.R.P. supported by an Australian Research Council International Fellowship. y Supported by an Australian Research Council Queen Elizabeth II Fellowship. 1 Introduction Background. Formal logic has been used by various authors to analyse and reason about knowledge. The possibleworlds semantics for knowledge logics initia...
RasiowaSikorski Deduction Systems: a Handy Tool for Computer Science Logics
 Recent Trends in Algebraic Specification Techniques, volume 1589 of LNCS
, 1998
"... . A RasiowaSikorski system is a sequencetype formalization of logics based on building decomposition trees of formulae labelled with sequences of formulae. Proofs are nite decomposition trees with leaves having \fundamental", valid labels. The system is dual to the tableau system. The author gives ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. A RasiowaSikorski system is a sequencetype formalization of logics based on building decomposition trees of formulae labelled with sequences of formulae. Proofs are nite decomposition trees with leaves having \fundamental", valid labels. The system is dual to the tableau system. The author gives examples of applying the RS formalism to various C.S and A.I. logic, including a logic for reasoning about relative similarity, a threevalued software specication logic with McCarthy's connectives, and a logic for nondeterministic specications. As a new result, an RS system for manysorted rst order logic with possibly empty carriers of some sorts is developed. 1 Introduction An issue in computer science logics that has gained much popularity lately are the socalled labelled deductive systems [5]. The predecessors of this type of deductive systems were Beth's tableau systems [1] and RasiowaSikorski (RS) deduction systems [12], both developed over thirty years ago. Their important...
A Correspondence Framework between ThreeValued Logics and SimilarityBased Approximate Reasoning
, 2006
"... This paper focuses on approximate reasoning based on the use of similarity spaces. Similarity spaces and the approximated relations induced by them are a generalization of the rough setbased approximations of Pawlak [17, 18]. Similarity spaces are used to define neighborhoods around individuals a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper focuses on approximate reasoning based on the use of similarity spaces. Similarity spaces and the approximated relations induced by them are a generalization of the rough setbased approximations of Pawlak [17, 18]. Similarity spaces are used to define neighborhoods around individuals and these in turn are used to define approximate sets and relations. In any of the approaches, one would like to embed such relations in an appropriate logic which can be used as a reasoning engine for specific applications with specific constraints. We propose a framework which permits a formal study of the relationship between approximate relations, similarity spaces and threevalued logics. Using ideas from correspondence theory for modal logics and constraints on an accessibility relation, we develop an analogous framework for threevalued logics and constraints on similarity relations. In this manner, we can provide a tool which helps in determining the proper threevalued logical reasoning engine to use for different classes of approximate relations generated via specific types of similarity spaces. Additionally, by choosing a threevalued logic first, the framework determines what constraints would be required on a similarity relation and the
Relative Nondeterministic Information Logic is EXPTIMEcomplete
 FUNDAMENTA INFORMATICAE
"... We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIMEcomplete. Such a logic combines two ingredients that are seldom present simultaneously in information logics: frame conditions involving m ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIMEcomplete. Such a logic combines two ingredients that are seldom present simultaneously in information logics: frame conditions involving more than one information relation and relative frames. The EXPTIME upper bound is obtained by designing a wellsuited decision procedure based on the nonemptiness problem of Büchi automata on infinite trees. The paper provides evidence that Büchi automata on infinite trees are crucial language acceptors even for relative information logics with multiple types of relations.