827 search results - page 37 / 166 » Proof-Theoretic Soundness and Completeness |
SOFSEM
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Formal methods based on the mathematical theory of partially ordered sets (i.e., posets) have been used in the database field for the modelling of spatial data since many...
TABLEAUX
2007
Springer
14 years 1 months ago
2007
Springer
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
AAAI
2008
13 years 10 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...