Hybrid Ockhamist temporal logic

Patrick Blackburn; Valentin Goranko

doi:10.1109/TIME.2001.930716

Hybrid Ockhamist temporal logic

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

Abstract

We introduce hybrid Ockhamist temporal logic, which combines the mechanisms of hybrid logic with Ockhamist semantics by employing nominals, satisfaction operators, binders, and quantifiers over branches. We provide a complete (with respect to bundled trees semantics) axiomatic system for the basic hybrid Ockhamist temporal logic (HOT) and for some of its extensions including the full hybrid Ockhamist temporal logic. The fill system is expressively equivalent to the first-order logic over trees extended with branch quantifiers which was proved decidable previously.

Originalsprog	Engelsk
Titel	Proceedings 8th International Symposium on Temporal Representation and Reasoning, TIME 2001
Redaktører	Claudio Bettini, Angelo Montanari
Antal sider	6
Forlag	IEEE
Publikationsdato	2001
Sider	183-188
Artikelnummer	930716
ISBN (Trykt)	0769511074, 9780769511078
DOI	https://doi.org/10.1109/TIME.2001.930716
Status	Udgivet - 2001
Udgivet eksternt	Ja
Begivenhed	8th International Symposium on Temporal Representation and Reasoning, TIME 2001 - Cividale del Friuli, Italien Varighed: 14 jun. 2001 → 16 jun. 2001

Konference

Konference	8th International Symposium on Temporal Representation and Reasoning, TIME 2001
Land/Område	Italien
By	Cividale del Friuli
Periode	14/06/2001 → 16/06/2001

Navn	Proceedings of the International Workshop on Temporal Representation and Reasoning

Link til dokument

10.1109/TIME.2001.930716

Citer dette

@inproceedings{8a5060f08b46447b9cd39ad3d1d5afe7,

title = "Hybrid Ockhamist temporal logic",

abstract = "We introduce hybrid Ockhamist temporal logic, which combines the mechanisms of hybrid logic with Ockhamist semantics by employing nominals, satisfaction operators, binders, and quantifiers over branches. We provide a complete (with respect to bundled trees semantics) axiomatic system for the basic hybrid Ockhamist temporal logic (HOT) and for some of its extensions including the full hybrid Ockhamist temporal logic. The fill system is expressively equivalent to the first-order logic over trees extended with branch quantifiers which was proved decidable previously.",

author = "Patrick Blackburn and Valentin Goranko",

year = "2001",

doi = "10.1109/TIME.2001.930716",

language = "English",

isbn = "0769511074",

series = "Proceedings of the International Workshop on Temporal Representation and Reasoning",

pages = "183--188",

editor = "Claudio Bettini and Angelo Montanari",

booktitle = "Proceedings 8th International Symposium on Temporal Representation and Reasoning, TIME 2001",

publisher = "IEEE",

address = "United States",

note = "8th International Symposium on Temporal Representation and Reasoning, TIME 2001 ; Conference date: 14-06-2001 Through 16-06-2001",

}

Blackburn, P & Goranko, V 2001, Hybrid Ockhamist temporal logic. i C Bettini & A Montanari (red), Proceedings 8th International Symposium on Temporal Representation and Reasoning, TIME 2001., 930716, IEEE, Proceedings of the International Workshop on Temporal Representation and Reasoning, s. 183-188, 8th International Symposium on Temporal Representation and Reasoning, TIME 2001, Cividale del Friuli, Italien, 14/06/2001. https://doi.org/10.1109/TIME.2001.930716

Hybrid Ockhamist temporal logic. / Blackburn, Patrick; Goranko, Valentin.
Proceedings 8th International Symposium on Temporal Representation and Reasoning, TIME 2001. red. / Claudio Bettini; Angelo Montanari. IEEE, 2001. s. 183-188 930716 (Proceedings of the International Workshop on Temporal Representation and Reasoning).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

T1 - Hybrid Ockhamist temporal logic

AU - Blackburn, Patrick

AU - Goranko, Valentin

PY - 2001

Y1 - 2001

N2 - We introduce hybrid Ockhamist temporal logic, which combines the mechanisms of hybrid logic with Ockhamist semantics by employing nominals, satisfaction operators, binders, and quantifiers over branches. We provide a complete (with respect to bundled trees semantics) axiomatic system for the basic hybrid Ockhamist temporal logic (HOT) and for some of its extensions including the full hybrid Ockhamist temporal logic. The fill system is expressively equivalent to the first-order logic over trees extended with branch quantifiers which was proved decidable previously.

AB - We introduce hybrid Ockhamist temporal logic, which combines the mechanisms of hybrid logic with Ockhamist semantics by employing nominals, satisfaction operators, binders, and quantifiers over branches. We provide a complete (with respect to bundled trees semantics) axiomatic system for the basic hybrid Ockhamist temporal logic (HOT) and for some of its extensions including the full hybrid Ockhamist temporal logic. The fill system is expressively equivalent to the first-order logic over trees extended with branch quantifiers which was proved decidable previously.

U2 - 10.1109/TIME.2001.930716

DO - 10.1109/TIME.2001.930716

M3 - Article in proceedings

AN - SCOPUS:31744440612

SN - 0769511074

SN - 9780769511078

T3 - Proceedings of the International Workshop on Temporal Representation and Reasoning

SP - 183

EP - 188

BT - Proceedings 8th International Symposium on Temporal Representation and Reasoning, TIME 2001

A2 - Bettini, Claudio

A2 - Montanari, Angelo

PB - IEEE

T2 - 8th International Symposium on Temporal Representation and Reasoning, TIME 2001

Y2 - 14 June 2001 through 16 June 2001

ER -