Sciweavers

DAM
1999
100views more  DAM 1999»
13 years 11 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
APAL
2010
81views more  APAL 2010»
13 years 11 months ago
Proof and refutation in MALL as a game
We present a setting in which the search for a proof of B or a refutation of B (i.e., a proof of
Olivier Delande, Dale Miller, Alexis Saurin
LICS
2008
IEEE
14 years 5 months ago
A Neutral Approach to Proof and Refutation in MALL
We propose a setting in which the search for a proof of B or a refutation of B (a proof of ¬B) can be carried out simultaneously: this is in contrast to the usual approach in aut...
Olivier Delande, Dale Miller