Defining answer classes using resolution refutation

Journal of Applied Logic 5 (1):70-91 (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The RM paraconsistent refutation system.Tomasz Skura - 2009 - Logic and Logical Philosophy 18 (1):65-70.
On Refutation Rules.Tomasz Skura - 2011 - Logica Universalis 5 (2):249-254.
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
The Complexity of Resolution Refinements.Joshua Buresh-Oppenheim & Toniann Pitassi - 2007 - Journal of Symbolic Logic 72 (4):1336 - 1352.
Relativization makes contradictions harder for Resolution.Stefan Dantchev & Barnaby Martin - 2014 - Annals of Pure and Applied Logic 165 (3):837-857.
A refutation theory.Tomasz Skura - 2009 - Logica Universalis 3 (2):293-302.

Analytics

Added to PP
2016-06-30

Downloads
10 (#1,025,836)

6 months
4 (#319,344)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

A Defence of Arbitrary Objects.Kit Fine & Neil Tennant - 1983 - Aristotelian Society Supplementary Volume 57 (1):55 - 89.
Logic for Problem Solving.Donald W. Loveland - 1982 - Journal of Symbolic Logic 47 (2):477-478.
Automated Theorem Proving. A Logical Basis.Donald W. Loveland - 1980 - Journal of Symbolic Logic 45 (3):629-630.

Add more references