367 search results - page 29 / 74 » Temporal Reasoning for Procedural Programs |
ICTL
1994
14 years 24 days 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...
LPNMR
1993
Springer
14 years 24 days ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
LOGCOM
1998
13 years 8 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
SIGSOFT
2005
ACM
14 years 9 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
EMNLP
2008
13 years 10 months ago
2008
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...