40 search results - page 5 / 8 » Compressing Propositional Refutations |
COLING
2008
13 years 9 months ago
2008
A noun-compound is a compressed proposition that requires an audience to recover the implicit relationship between two concepts that are expressed as nouns. Listeners recover this...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Schematic proofs are functions which can produce a proof of a proposition for each value of their parameters. A schematic proof can be constructed by abstracting a general pattern ...
TABLEAUX
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...
TABLEAUX
1999
Springer
13 years 12 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
TABLEAUX
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...