AbstractStarting from the intuition given by Wu's algorithm for the resolution of polynomial systems, we construct new efficient resolution strategies for propositional clauses
We examine the proof-theoretic strength of parameterized tree-like resolution—a proof sys-tem for th...
We establish new, and surprisingly tight, connections between propositional proof complexity and fin...
AbstractThe basis of this paper is the observation that for several proof systems for propositional ...
AbstractStarting from the intuition given by Wu's algorithm for the resolution of polynomial systems...
AbstractCompletion theorem proving, as proposed by J. Hsiang (1982), is based on the observation tha...
A comparative study on the complexity of various procedures for proving that a set of clauses is co...
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linea...
It is shown that any sequence psi_n of tautologies which expresses thevalidity of a fixed combinato...
There are many different ways of proving formulas in proposition logic. Many of these can easily be ...
Thesis (Ph. D.)--University of Washington, 2005.This thesis explores algorithmic applications of pro...
AbstractIn this paper we investigate automated theorem proving systems represented as finite classes...
AbstractThe resolution tree problem consists of deciding whether a given sequence-like resolution re...
We review the fundamental resolution-based methods for first-order theorem proving and present them ...
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the re...
AbstractAn N-resolution proof is a resolution proof in which the resolution rule is restricted: one ...
We examine the proof-theoretic strength of parameterized tree-like resolution—a proof sys-tem for th...
We establish new, and surprisingly tight, connections between propositional proof complexity and fin...
AbstractThe basis of this paper is the observation that for several proof systems for propositional ...
AbstractStarting from the intuition given by Wu's algorithm for the resolution of polynomial systems...
AbstractCompletion theorem proving, as proposed by J. Hsiang (1982), is based on the observation tha...
A comparative study on the complexity of various procedures for proving that a set of clauses is co...
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linea...
It is shown that any sequence psi_n of tautologies which expresses thevalidity of a fixed combinato...
There are many different ways of proving formulas in proposition logic. Many of these can easily be ...
Thesis (Ph. D.)--University of Washington, 2005.This thesis explores algorithmic applications of pro...
AbstractIn this paper we investigate automated theorem proving systems represented as finite classes...
AbstractThe resolution tree problem consists of deciding whether a given sequence-like resolution re...
We review the fundamental resolution-based methods for first-order theorem proving and present them ...
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the re...
AbstractAn N-resolution proof is a resolution proof in which the resolution rule is restricted: one ...
We examine the proof-theoretic strength of parameterized tree-like resolution—a proof sys-tem for th...
We establish new, and surprisingly tight, connections between propositional proof complexity and fin...
AbstractThe basis of this paper is the observation that for several proof systems for propositional ...
DOI
Add to ORKG