4617 search results - page 775 / 924 » Automation of Diagrammatic Reasoning |
196
click to vote
LICS
2002
IEEE
15 years 12 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
224
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
201
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
192
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
185
click to vote
LICS
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...