3658 search results - page 282 / 732 » The logic of proofs, semantically |
156
click to vote
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
Gandalf is a first-order resolution theorem-prover, optimized for speed and specializing in manipulations of large clauses. In this paper I describe GANDALF TAC, a HOL tactic that ...
168
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
187
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
151
click to vote
BIRTHDAY
2005
Springer
16 years 9 days ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...