Sciweavers

393 search results - page 9 / 79
» Logic Programs with Classical Negation
Sort
View
ENTCS
2007
82views more  ENTCS 2007»
13 years 7 months ago
On the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
Jayshan Raghunandan, Alexander J. Summers
JUCS
2006
104views more  JUCS 2006»
13 years 7 months ago
Constructive Failure in Functional-Logic Programming: From Theory to Implementation
: Functional-logic programming amalgamates some of the main features of both functional and logic styles into a single paradigm. Nevertheless, negation is a widely investigated fea...
Jaime Sánchez-Hernández
IJCAI
1989
13 years 8 months ago
Negative Reasoning Using Inheritance
This paper presents methods of default reasoning which allow us to draw negative conclusions that are not available in some of the models for inheritance reasoning. Some of these ...
Lin Padgham
CSL
2005
Springer
14 years 27 days ago
Distributed Control Flow with Classical Modal Logic
In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities P and Q we were able to capture t...
Tom Murphy VII, Karl Crary, Robert Harper
JSYML
2006
124views more  JSYML 2006»
13 years 7 months ago
Glivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
Nikolaos Galatos, Hiroakira Ono