2006
DOI: 10.1007/s11229-005-5516-7
|View full text |Cite
|
Sign up to set email alerts
|

Operators vs. Arguments: The Ins and Outs of Reification

Abstract: So-called 'reified temporal logics' were introduced by researchers in Artificial Intelligence (AI) in the early 1980s, and gave rise to a long-running series of debates concerning the proper way to represent states, events, causation, action, and other notions identified as crucial to the knowledge representation needs of AI. These debates never resulted in a definitive resolution of the issues under discussion, and indeed continue to produce aftershocks to the present day; none the less, we are now sufficient… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
52
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 65 publications
(53 citation statements)
references
References 17 publications
(16 reference statements)
0
52
0
Order By: Relevance
“…This language can be classified as a sorted reified temporal predicate logic language (see, e.g., Galton, 2003Galton, , 2006, in contrast to, for example, modal-logic-based temporal logics as the ones discussed in, e.g., (Fisher, 2005). The language is briefly introduced here.…”
Section: Formalising Patterns In World Dynamics and Their Relationshipsmentioning
confidence: 99%
“…This language can be classified as a sorted reified temporal predicate logic language (see, e.g., Galton, 2003Galton, , 2006, in contrast to, for example, modal-logic-based temporal logics as the ones discussed in, e.g., (Fisher, 2005). The language is briefly introduced here.…”
Section: Formalising Patterns In World Dynamics and Their Relationshipsmentioning
confidence: 99%
“…Both behavioural specifications and cognitive process models are specified using the reified temporal predicate language RTPL [7], a many-sorted temporal predicate logic language that allows specification and reasoning about the dynamics of a system. To express state properties ontologies are used.…”
Section: Modelling Languagementioning
confidence: 99%
“…We present a reified first-order logical theory [6] that makes temporal reasoning about regular multiple recurrence possible. It is reified because the eventualities we quantify and reason about may have a hidden propositional structure from which we abstract away.…”
Section: Introductionmentioning
confidence: 99%