Sciweavers

204 search results - page 11 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
RTA
2010
Springer
13 years 11 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
CORR
2010
Springer
71views Education» more  CORR 2010»
13 years 7 months ago
The relational model is injective for Multiplicative Exponential Linear Logic (without weakenings)
We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic ...
Daniel de Carvalho, Lorenzo Tortora de Falco
FMCO
2007
Springer
124views Formal Methods» more  FMCO 2007»
13 years 11 months ago
Certification Using the Mobius Base Logic
This paper describes a core component of Mobius' Trusted Code Base, the Mobius base logic. This program logic facilitates the transmission of certificates that are generated u...
Lennart Beringer, Martin Hofmann, Mariela Pavlova
LANMR
2004
13 years 9 months ago
Computing Preferred Safe Beliefs
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
Luis A. Montiel, Juan A. Navarro
CADE
2007
Springer
14 years 7 months ago
Encoding First Order Proofs in SAT
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin,...