Sciweavers

71 search results - page 1 / 15
» Complete Cuboidal Sets in Axiomatic Domain Theory
Sort
View
LICS
1997
IEEE
13 years 8 months ago
Complete Cuboidal Sets in Axiomatic Domain Theory
Marcelo P. Fiore, Gordon D. Plotkin, A. John Power
AMAI
2002
Springer
13 years 4 months ago
A Complete Axiomatization for Blocks World
Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on axiomatizing the state constraints of BW and giving jus...
Stephen A. Cook, Yongmei Liu
DALT
2005
Springer
13 years 10 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
ICFP
2003
ACM
14 years 4 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
LICS
2007
IEEE
13 years 11 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam