Sciweavers

3044 search results - page 11 / 609
» Linear logical approximations
Sort
View
TCS
2011
13 years 2 months ago
Correctness of linear logic proof structures is NL-complete
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
Paulin Jacobé de Naurois, Virgile Mogbil
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 7 months ago
Anytime Approximations of Classical Logic from Above
In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of...
Marcelo Finger, Renata Wassermann
ICLP
2001
Springer
13 years 12 months ago
Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic
Mutsunori Banbara, Kyoung-Sun Kang, Takaharu Hirai...
APAL
2008
159views more  APAL 2008»
13 years 7 months ago
Approximations of modal logics: K and beyond
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...
Guilherme de Souza Rabello, Marcelo Finger
ENTCS
2011
129views more  ENTCS 2011»
13 years 2 months ago
Specifying Proof Systems in Linear Logic with Subexponentials
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
Vivek Nigam, Elaine Pimentel, Giselle Reis