Sciweavers

204 search results - page 9 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 7 months ago
A multivalued knowledge-base model
Abstract. The basic aim of our study is to give a possible model for handling uncertain information. This model is worked out in the framework of DATALOG. At first the concept of f...
Agnes Achs
CAV
2003
Springer
107views Hardware» more  CAV 2003»
14 years 24 days ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
ESOP
1999
Springer
13 years 12 months ago
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
Andreas Podelski, Witold Charatonik, Martin Mü...
APAL
2005
78views more  APAL 2005»
13 years 7 months ago
The logic of proofs, semantically
A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of se...
Melvin Fitting
CADE
2008
Springer
14 years 7 months ago
Proof Systems for Effectively Propositional Logic
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
Andrei Voronkov, Juan Antonio Navarro Pérez