Technical, Research Report
@TechReport
Technischer-, Forschungsbericht


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:









Author, Editor

Author(s):

Blackburn, Patrick
Tzakova, Miroslava

dblp
dblp



Editor(s):





BibTeX Citekey*:

Tzakova98d

Language:

English

Title, Institution

Title*:

Hybrid Languages and Temporal Logic (Full Version)

Institution*:

Computational Lingustics, Universität des Saarlandes

Publishers or Institutions Address*:

Saarbrücken, Germany

Type:

Research Report

No, Year, pp.,

Number*:

CLAUS 96

Pages*:

50

Month:

July

VG Wort
Pages*:


Year*:

1998

ISBN/ISSN:






DOI:




Note, Abstract, ©

Note:


(LaTeX) Abstract:

Hybridization is a method invented by Arthur Prior for extending the expressive power of modal languages. Although
developed in interesting ways by Robert Bull, and the Sofia school (notably, George Gargov, Valentin Goranko, Solomon Passy
and Tinko Tinchev), the method remains little known. In our view this has deprived temporal logic of a valuable tool. The
aim of the paper is to explain why hybridization is useful in temporal logic. We make two major points, the first
technical, the second conceptual. Technically, we show that hybridization gives rise to well-behaved logics that exhibit an
interesting synergy between modal and classical ideas. This synergy, obvious for hybrid languages with full first-order
expressive strength, is demonstrated for three weaker local languages, all of which are capable of defining the Until
operator; we provide simple minimal axiomatizations for all three systems, and show that in a wide range of temporally
interesting cases, extended completeness results can be obtained automatically. Conceptually, we argue that the idea of
sorted atomic symbols which underpins the hybrid enterprise can be developed much further. To illustrate this, we discuss
the advantages and disadvantages of a simple hybrid language which can quantify over paths. This is the original version of
a paper which was accepted for publication in a special issue of the Journal of the IGPL on temporal logic. Unfortunately,
the length of the article meant that it had to be drastically cut, and only a shorter version will appear. While the short
version covers one of the most elegant results (@-driven completeness results) and is slightly more up to date in certain
respects, the long version is probably the most detailed discussion of the completeness theory of local hybrid languages
around. The long version also contains many lengthy footnotes. These outline the history of hybrid languages in
considerable detail, and contain many remarks on philosophical, methodological, and technical issues.

Categories / Keywords:


Copyright Message:


HyperLinks / References / URLs:


Personal Comments:


File Upload:


Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat


BibTeX Entry:
@TECHREPORT{Tzakova98d,
AUTHOR = {Blackburn, Patrick and Tzakova, Miroslava},
TITLE = {Hybrid Languages and Temporal Logic (Full Version)},
YEAR = {1998},
TYPE = {Research Report},
INSTITUTION = {Computational Lingustics, Universität des Saarlandes},
NUMBER = {CLAUS 96},
PAGES = {50},
ADDRESS = {Saarbr{\"u}cken, Germany},
MONTH = {July},
}


Entry last modified by Miroslava Tzakova, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Miroslava Tzakova
Created
05/19/1999 03:56:44 PM
Revision
0.



Editor
Miroslava Tzakova



Edit Date
19/05/99 15:56:44