528 search results - page 22 / 106 » Transition Logic Revisited |
116
Voted
DBPL
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
102
Voted
KR
2010
Springer
15 years 6 months ago
2010
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
116
Voted
CADE
1994
Springer
15 years 6 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
102
click to vote
ESOP
2012
Springer
13 years 9 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
101
click to vote
APAL
2005
15 years 1 months ago
2005
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...