%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:20 +0100 GMT
%    
% Selection : Author: Maarten_de-Rijke
%




@TechReport{Blackburn_de Rijke:1994,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten},
      TITLE = {Zooming In, Zooming Out},
      YEAR = {1994},
      MONTH = {November},
      NUMBER = {48},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus48.dvi ftp://ftp.coli.uni-sb.de/pub/claus/claus48.ps},
      ABSTRACT = {This is an exploratory paper about combining logics, combining theories and combining structures. Typically when one applies logic to such areas as computer science, artificial intelligence or linguistics, one encounters hybrid ontologies. The aim of this paper is to identify plausible strategies for coping with ontological richness.},
      ANNOTE = {COLIURL : Blackburn:1994:ZZ.pdf Blackburn:1994:ZZ.ps Blackburn:1994:ZZ.dvi}
}

@TechReport{Blackburn_de Rijke:1995,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten},
      TITLE = {Why Combine Logics?},
      YEAR = {1995},
      MONTH = {April},
      NUMBER = {57},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus57.ps},
      ABSTRACT = {Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailored made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standard languages. By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. Using the history of quantified modal logic as our main example, we also show that the use of combined structures and logics is a recurring theme in the analysis of existing logical systems.},
      ANNOTE = {COLIURL : Blackburn:1995:WCL.pdf Blackburn:1995:WCL.ps}
}

@Article{Blackburn_de Rijke:1996,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten},
      TITLE = {Combining Logics. Special Issue},
      YEAR = {1996},
      JOURNAL = {Notre Dame Journal of Formal Logic},
      VOLUME = {37}
}

@Article{Blackburn_de Rijke:1997,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten},
      TITLE = {Why Combine Logics?},
      YEAR = {1997},
      JOURNAL = {Studia Logica. An International Journal for Symbolic Logic},
      VOLUME = {59},
      NUMBER = {1},
      PAGES = {5-27},
      NOTE = {but published later}
}

@Article{Blackburn_de Rijke:1997_1,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten},
      TITLE = {Zooming In, Zooming Out},
      YEAR = {1997},
      JOURNAL = {Journal of Logic, Language and Information},
      VOLUME = {6},
      PAGES = {5-31}
}

@TechReport{Blackburn_et_al:1994,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten and Vennema, Ide},
      TITLE = {The Algebra of Modal Logic},
      YEAR = {1994},
      MONTH = {November},
      NUMBER = {47},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus47.dvi},
      ABSTRACT = {Our main aim is to review the frame semantics and axiomatics of modal logic from the perspective of the duality between (Kripke) frames and boolean algebras with operators as defined by Jónsson and Tarski. To this end, we introduce modal languages and their interpretation in models and frames in Part II. We define and discuss the notion of a modal formula characterizing a class of frames or models, and give the Sahlqvist algorithm which yields, given a suitable modal formula as input, the corresponding first-order condition on the class of frames characterized by the formula. We define the concept of a normal modal logic and explain the canonical frame method for proving completeness of a logic with respect to classes of frames. In Part III we develop the algebraic perspective on modal logic. We introduce boolean algebras with operators and show how they arise naturally in both the semantic and the axiomatic approach towards algebraizing modal logic. We discuss in detail how the category of boolean algebras with operators and homomorphisms links up with the category of frames with so-called bounded morphisms. Finally, we apply this duality to give easy proofs for some important and well-known results from modal logic.},
      ANNOTE = {COLIURL : Blackburn:1994:AML.ps Blackburn:1994:AML.dvi}
}

@TechReport{Blackburn_et_al:1995,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten and Vennema, Ide},
      TITLE = {Relational Methods in Logic, Language and Information},
      YEAR = {1995},
      MONTH = {September},
      NUMBER = {65},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus65.ps},
      ABSTRACT = {This paper discusses the use of relational methods in the interdisciplinary field of Logic, Language and Information. We first sketch the developments that lead to the current focus on dynamics in the area. After that we give examples of logics of transitions that naturally arise in this setting, and we identify more general themes such as bisimulations, relativisations and dynamic modes of inference. We conclude with a discussion of newly emerging themes, and the limitations of the relational perspective.},
      ANNOTE = {COLIURL : Blackburn:1995:RML.pdf Blackburn:1995:RML.ps}
}

@InCollection{Blackburn_et_al:1997,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten and Vennema, Ide},
      TITLE = {Relational Methods in Logic, Language and Information},
      YEAR = {1997},
      BOOKTITLE = {Relational Methods in Computer Science},
      PAGES = {211-225},
      EDITOR = {Brink, C. and Kahl, W. and Schmidt, G.},
      SERIES = {Advances in Computing Sciences},
      ADDRESS = {Berlin},
      PUBLISHER = {Springer}
}

@TechReport{Blackburn_et_al:1996,
      AUTHOR = {Blackburn, Patrick and Jaspars, Jan and de Rijke, Maarten},
      TITLE = {Reasoning about Changing Information},
      YEAR = {1996},
      MONTH = {September},
      NUMBER = {81},
      PAGES = {25},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus81.ps},
      ABSTRACT = {The purpose of these notes is two-fold: (i) to give a reasonably self-contained introduction to a particular approach to theory change, known as the Alchourron-Gardenfors-Makinson (AGM) approach, and to discuss some of the alternatives and extensions that have been proposed to it over the past few years; (ii) to relate the AGM approach to other 'information-oriented' branches of logic, including intuitionistic logic, non-monotonic reasoning, verisimilitude, and modal and dynamic logic.},
      ANNOTE = {COLIURL : Blackburn:1996:RAC.pdf Blackburn:1996:RAC.ps}
}

@TechReport{Blackburn_et_al:1995_1,
      AUTHOR = {Blackburn, Patrick and Meyer-Viol, Wilfried and de Rijke, Maarten},
      TITLE = {A Proof System for Finite Trees},
      YEAR = {1995},
      MONTH = {October},
      NUMBER = {67},
      PAGES = {19},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus67.ps},
      ABSTRACT = {In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol and Blackburn and Meyer-Viol. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.},
      ANNOTE = {COLIURL : Blackburn:1995:PSFb.pdf}
}

@InProceedings{Blackburn_et_al:1995_2,
      AUTHOR = {Blackburn, Patrick and Meyer-Viol, Wilfried and de Rijke, Maarten},
      TITLE = {A Proof System for Finite Trees},
      YEAR = {1995},
      BOOKTITLE = {Computer Science Logic. 9th International Workshop (CSL '95)},
      NUMBER = {1092},
      PAGES = {86-105},
      EDITOR = {Kleine Büning, H.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Berlin},
      PUBLISHER = {Springer}
}

@InProceedings{Gabsdil_Striegnitz:1999,
      AUTHOR = {Gabsdil, Malte and Striegnitz, Kristina},
      TITLE = {Classifying Scope Ambiguities},
      YEAR = {1999},
      BOOKTITLE = {1st Workshop on Inference in Computational Semantics (ICoS-1), August 15},
      PAGES = {125-131},
      EDITOR = {Monz, Christof and de Rijke, Maarten},
      ADDRESS = {Amsterdam, The Netherlands},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/icos99.ps.gz},
      ABSTRACT = {We describe the architecture and implementation of a system which compares semantic representations of natural language input w.r.t. equivalence of logical content and context change potential. Giving a clear graphical representation of the relationship between different readings, the stand-alone version of the system can be used as a classroom tool. Furthermore the core system can be incorporated into other discourse processing systems (e.g. Johan Bos' DORIS system (Bos 1998) where one might want to ignore logically equivalent readings in order to keep the number of readings small and thus improve efficiency. The system relies heavily on existing implementations and code available via the internet. These are integrated and put to the desired use by a Prolog interface. By illustrating the architecture of this system, we want to argue that it is possible to build rather complex systems involving multiple levels of linguistic processing without having to spend an unreasonably large amount of time on the implementation of basic functionalities.},
      ANNOTE = {COLIURL : Gabsdil:1999:CSA.pdf Gabsdil:1999:CSA.ps}
}