40 search results - page 6 / 8 » Compressing Propositional Refutations |
FUIN
2007
13 years 7 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
LOGCOM
2002
13 years 7 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
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...
ECIS
2003
13 years 9 months ago
2003
Positivist, single case study is an important research approach within the information systems discipline. This paper provides detailed definitions of key concepts in positivist, ...
IJCAI
1993
13 years 9 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...