Sciweavers

1814 search results - page 142 / 363
» Extended First-Order Logic
Sort
View
160
Voted
LFCS
1992
Springer
15 years 7 months ago
Denotations for Classical Proofs - Preliminary Results
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
Philippe de Groote
174
Voted
IBERAMIA
2010
Springer
15 years 1 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
138
Voted
EDBT
2000
ACM
15 years 7 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
221
Voted
POPL
2002
ACM
16 years 3 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...
ICFP
2005
ACM
16 years 3 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell