scholarly journals Execution and Proof in a Horn-Clause Temporal Logic

2000 ◽  
pp. 413-433 ◽  
Author(s):  
Clare Dixon ◽  
Michael Fisher ◽  
Mark Reynolds
Keyword(s):  
Temporal Logic ◽  
Horn Clause

Anticipating Nostalgia:Finding Temporal Logic in Textual Anomaly

2009 ◽  
Vol 4 (1) ◽  
pp. 72-83 ◽  
Author(s):  
Linda Charnes
Keyword(s):  
Temporal Logic

Alternating-time temporal logic with strong and weak exceptions

2009 ◽  
Vol 28 (11) ◽  
pp. 2874-2876 ◽  
Author(s):  
Xian-wei LAI ◽  
Shan-li HU ◽  
Zheng-yuan NING ◽  
Xiu-li WANG
Keyword(s):  
Temporal Logic

Peristrephic Visions

2017 ◽  
Author(s):  
Michael Germana
Keyword(s):  
Temporal Logic ◽  
White Supremacist ◽  
Invisible Man ◽  
The Future

Chapter 2 examines Ralph Ellison’s Invisible Man as a text that ekphrastically simulates a moving or “peristrephic” panorama in general, and an antebellum antislavery panorama in particular. In the process, this chapter reads Ellison’s debut novel as a text indebted to and allusive of, while ironically commenting on, the life and career of celebrated fugitive and peristrephic panoramist Henry Box Brown, who shipped himself in a sealed wooden crate from Richmond to Philadelphia and thus from slavery to freedom in 1849. Brown’s subsequent efforts to navigate the terrain of abolitionist discourse within a white supremacist culture led him to create a moving panorama called the Mirror of Slavery, which chronicled the cruelties of slavery, yet ended with the promise of universal emancipation. In appropriating the visual grammar of the antislavery panorama, Ellison also extends its ambivalent temporal logic to create his own alternative history in service of the future.

Towards the Temporal Approach to Abstract Data Types

1988 ◽  
Vol 11 (1) ◽  
pp. 49-63
Author(s):  
Andrzej Szalas
Keyword(s):  
Temporal Logic ◽  
Abstract Data Types ◽  
Data Types ◽  
First Order ◽  
Abstract Data ◽  
Order Completeness ◽  
General Method

In this paper we deal with a well known problem of specifying abstract data types. Up to now there were many approaches to this problem. We follow the axiomatic style of specifying abstract data types (cf. e.g. [1, 2, 6, 8, 9, 10]). We apply, however, the first-order temporal logic. We introduce a notion of first-order completeness of axiomatic specifications and show a general method for obtaining first-order complete axiomatizations. Some examples illustrate the method.

Verifying linear time temporal logic properties of concurrent Ada programs with quasar

2004 ◽  
Vol XXIV (1) ◽  
pp. 17-24 ◽  
Author(s):  
S. Evangelista ◽  
C. Kaiser ◽  
J. F. Pradat-Peyre ◽  
P. Rousseau
Keyword(s):  
Temporal Logic ◽  
Linear Time ◽  
Linear Time Temporal Logic

Learning from Demonstrations Using Signal Temporal Logic in Stochastic and Continuous Domains

2021 ◽  
pp. 1-1
Author(s):  
Aniruddh Gopinath Puranic ◽  
Jyotirmoy Deshmukh ◽  
Stefanos Nikolaidis
Keyword(s):  
Temporal Logic ◽  
Learning From Demonstrations ◽  
Continuous Domains

L.0: a parallel executable temporal logic language

1990 ◽  
Vol 15 (4) ◽  
pp. 80-89
Author(s):  
Linda Ness
Keyword(s):  
Temporal Logic
Sign in / Sign up

Export Citation Format

Share Document