Sciweavers

393 search results - page 6 / 79
» Logic Programs with Classical Negation
Sort
View
LFCS
1992
Springer
13 years 11 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
TARK
2005
Springer
14 years 25 days ago
First-order classical modal logic: applications in logics of knowledge and probability
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
Horacio L. Arló-Costa, Eric Pacuit
JLP
2000
134views more  JLP 2000»
13 years 7 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
ICFP
2010
ACM
13 years 7 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic