827 search results - page 27 / 166 » Proof-Theoretic Soundness and Completeness |
JSAI
2007
Springer
14 years 1 months ago
2007
Springer
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
APLAS
2000
ACM
14 years 1 days ago
2000
ACM
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
ICDT
2007
ACM
13 years 11 months ago
2007
ACM
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
CLIMA
2007
13 years 9 months ago
2007
We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...
FAC
2008
13 years 7 months ago
2008
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...