135 search results - page 8 / 27 » Temporal Description Logics: A Survey |
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
198
click to vote
EPIA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider the representation and execution of agents specified using temporal logics. Previous work in this area has provided a basis for the direct execution of agent...
173
click to vote
ICTL
1994
15 years 10 months ago
1994
In this paper we present a survey of work relating to the Concurrent METATEM programming language. In addition to a description of the basic Concurrent METATEM system, which incorp...
151
click to vote
DLOG
1998
15 years 7 months ago
1998
Abstract We address the problem of indexing broadcast audiovisual documents (such as films, news). Starting from a collection of so-called shots, we aim at building automatically h...
160
click to vote
TOCL
2008
15 years 6 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...