137 search results - page 12 / 28 » Reasoning About Transfinite Sequences |
SYNASC
2008
IEEE
14 years 2 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
ATAL
2001
Springer
14 years 5 days ago
2001
Springer
We develop an approach in which we model communication protocols via commitment machines. Commitment machines supply a content to protocol states and actions in terms of the social...
NIPS
2008
13 years 9 months ago
2008
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
IJCAI
1997
13 years 9 months ago
1997
We consider the frame problem, that is, char acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...
JFP
2007
13 years 7 months ago
2007
Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results fr...