Sciweavers

3333 search results - page 15 / 667
» Abstract Proof Search
Sort
View
IJCAI
2007
13 years 11 months ago
A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks
argumentation frameworks have played a major role as a way of understanding argumentbased inference, resulting in different argumentbased semantics. In order to make such semantic...
Carlos Iván Chesñevar, Guillermo Ric...
APAL
2008
67views more  APAL 2008»
13 years 9 months ago
Proof nets sequentialisation in multiplicative linear logic
Abstract. We provide an alternative proof of the sequentialisation theorem for proof nets of multiplicative linear logic. Namely, we show how a proof net can be transformed into a ...
Paolo Di Giamberardino, Claudia Faggian
FOCS
1999
IEEE
14 years 1 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi
TABLEAUX
1995
Springer
14 years 1 months ago
A Connection Based Proof Method for Intuitionistic Logic
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
Jens Otten
RTA
2007
Springer
14 years 3 months ago
A Simple Proof That Super-Consistency Implies Cut Elimination
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
Gilles Dowek, Olivier Hermant