Sciweavers

414 search results - page 6 / 83
» Resolution for Intuitionistic Logic
Sort
View
APAL
2006
91views more  APAL 2006»
13 years 7 months ago
Computing interpolants in implicational logics
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...
Makoto Kanazawa
IJFCS
2000
71views more  IJFCS 2000»
13 years 7 months ago
Light Affine Logic as a Programming Language: A First Contribution
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
Luca Roversi
JAPLL
2006
112views more  JAPLL 2006»
13 years 7 months ago
Intuitionistic hybrid logic
Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first const...
Torben Braüner, Valeria de Paiva
LOGCOM
2010
136views more  LOGCOM 2010»
13 years 6 months ago
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But ...
Rajeev Goré, Linda Postniece
ECAI
2010
Springer
13 years 8 months ago
A constructive conditional logic for access control: a preliminary report
We define an Intuitionistic Conditional Logic for Access Control called CICL . The logic CICL is based on a conditional language allowing principals to be defined as arbitrary form...
Valerio Genovese, Laura Giordano, Valentina Gliozz...