2649 search results - page 230 / 530 » Temporal Theories of Reasoning |
163
click to vote
CCL
1994
Springer
15 years 10 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
197
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We introduce a nonmonotonic framework for belief revision in which reasoning about the reliability of different pieces of information based on meta-knowledge about the in...
152
click to vote
CSL
2002
Springer
15 years 6 months ago
2002
Springer
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" apprao...
163
click to vote
ATAL
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Design by contract is a well known theory that views software construction as based on contracts between clients (callers) and suppliers (routines), relying on mutual obl...
165
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...