Sciweavers

265 search results - page 31 / 53
» Inductive Situation Calculus
Sort
View
ACL
1997
13 years 8 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 7 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
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...
Munindar P. Singh
DKE
2006
93views more  DKE 2006»
13 years 7 months ago
The ramification problem in temporal databases: Changing beliefs about the past
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Grigoris Antoniou, Dimitris Plexo...
IJIS
2010
110views more  IJIS 2010»
13 years 4 months ago
The ramification problem in temporal databases: Concurrent execution
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Dimitris Plexousakis, Grigoris An...
ASP
2001
Springer
13 years 11 months ago
Additive Fluents
We propose a situation calculus formalization of action domains that include numeric-valued fluents (so-called additive or measure fluents) and concurrency. Our approach allows fo...
Joohyung Lee, Vladimir Lifschitz