827 search results - page 105 / 166 » Proof-Theoretic Soundness and Completeness |
110
click to vote
SAS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
184
Voted
POPL
2004
ACM
16 years 1 months ago
2004
ACM
The contribution of the paper is twofold. First, we define a general notion of type system equipped with an entailment relation between type environments; this generalisation serv...
111
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
112
Voted
RR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The Semantic Web is commonly perceived as a web of partially interlinked machine readable data. This data is inherently distributed and resembles the structure of the web...
89
Voted
TABLEAUX
2007
Springer
15 years 6 months ago
2007
Springer
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with...