Access the full text.
Sign up today, get DeepDyve free for 14 days.
C Areces, P Blackburn, SR Delany (2001)
Bringing them all togetherJ. Log. Comput., 11
M Crochemore, DM Gabbay (2011)
Reactive automataInf. Comput., 209
J Benthem (2005)
Mechanizing Mathematical Reasoning
D Harel, A Pnueli (1985)
On the Development of Reactive Systems
DM Gabbay, K Schlechta (2009)
Reactive preferential structures and nonmonotonic consequenceRev. Symb. Log., 2
DM Gabbay, K Schlechta (2010)
Logical Tools for Handling Change in Agent-Based Systems, Cognitive Technologies
DM Gabbay (2008)
DEON
G Gargov, V Goranko (1993)
Modal logic with namesJ. Philos. Logic, 22
DM Gabbay, K Schlechta (2010)
A theory of hierarchical consequence and conditionalsJ. Logic, Lang. Inf., 19
AN Prior (1956)
Modality and quantification in S5J. Symb. Log., 21
DM Gabbay, K Schlechta (2009)
Defeasible inheritance systems and reactive diagramsLog. J. IGPL, 17
A Zanardo (1996)
Branching-time logic with quantification over branches: the point of view of modal logicJ. Symb. Logic, 61
P Blackburn, M Rijke, Y Venema (2001)
Modal Logic
DM Gabbay, A Kurucz, F Wolter, M Zakharyaschev (2003)
Studies in Logic and the Foundations of Mathematics, vol. 148
RA Bull (1970)
An approach to tense logicTheoria, 36
P Blackburn, M Tzakova (1999)
Hybrid languages and temporal logicLog. J. IGPL, 7
S Modgil (2009)
Reasoning about preferences in argumentation frameworksArtif. Intell., 173
DM Gabbay, S Marcelino (2009)
Modal logics of reactive framesStud. Log., 93
P Blackburn (2000)
Representation, reasoning, and relational structures: a hybrid logic manifestoLog. J. IGPL, 8
P Blackburn, B Cate (2006)
Pure extensions, proof rules, and hybrid axiomaticsStud. Log., 84
J Benthem (2007)
Dynamic logic for belief revisionJ. Appl. Non-Class. Log., 17
A Prior (1967)
Past, Present and Future
DM Gabbay (2011)
Reactive intuitionistic tableauxSynthese, 179
P Blackburn, JFAK Benthem, F Wolter (2006)
Handbook of modal logic. In: Studies in Logic and Practical Reasoning, vol. 3
DM Gabbay (2002)
A theory of hypermodal logics: mode shifting in modal logicJ. Philos. Logic, 31
C Areces, P Blackburn, M Marx (1999)
Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic, CSL ’99
The notion of reactive graph generalises the one of graph by allowing the base accessibility relation to change when its edges are traversed. Can we represent these more general structures using points and arrows? We prove this can be done by introducing higher order arrows: the switches. The possibility of expressing the dependency of the future states of the accessibility relation on individual transitions by the use of higher-order relations, that is, coding meta-relational concepts by means of relations, strongly suggests the use of modal languages to reason directly about these structures. We introduce a hybrid modal logic for this purpose and prove its completeness.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Sep 19, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.