Sciweavers

25 search results - page 4 / 5
» A Formalization of Program Debugging in the Situation Calcul...
Sort
View
DBPL
2003
Springer
120views Database» more  DBPL 2003»
13 years 11 months ago
A Unifying Semantics for Active Databases Using Non-Markovian Theories of Actions
Over the last fifteen years, database management systems (DBMSs) have been enhanced by the addition of rule-based programming to obtain active DBMSs. One of the greatest challeng...
Iluju Kiringa, Raymond Reiter
ECP
1997
Springer
102views Robotics» more  ECP 1997»
13 years 10 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
FPCA
1995
13 years 9 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
AAAI
2000
13 years 7 months ago
What Sensing Tells Us: Towards a Formal Theory of Testing for Dynamical Systems
Just as actions can have indirect effects on the state of the world, so too can sensing actions have indirect effects on an agent's state of knowledge. In this paper, we inve...
Sheila A. McIlraith, Richard B. Scherl
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 5 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