38 search results - page 5 / 8 » Sound and Complete Inference Rules for SE-Consequence |
FUIN
2007
13 years 7 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
POPL
1991
ACM
13 years 11 months ago
1991
ACM
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
ER
2007
Springer
14 years 1 months ago
2007
Springer
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental is...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural...