Sciweavers

1410 search results - page 62 / 282
» Proving theorems by reuse
Sort
View
ENTCS
2007
83views more  ENTCS 2007»
13 years 10 months ago
Enhancing Theorem Prover Interfaces with Program Slice Information
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
Louise A. Dennis
JCT
2007
82views more  JCT 2007»
13 years 10 months ago
A new generalization of Mantel's theorem to k-graphs
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
Dhruv Mubayi, Oleg Pikhurko
COMBINATORICA
2004
97views more  COMBINATORICA 2004»
13 years 9 months ago
Partition Theorems for Left and Right Variable Words
In 1984 T. Carlson and S. Simpson established an infinitary extension of the Hales-Jewett Theorem in which the leftmost letters of all but one of the words were required to be vari...
Neil Hindman, Randall McCutcheon
EUSFLAT
2009
171views Fuzzy Logic» more  EUSFLAT 2009»
13 years 7 months ago
Convergence Theorems for Generalized Random Variables and Martingales
We examine generalizations of random variables and martingales. We prove a new convergence theorem for setvalued martingales. We also generalize a well known characterization of se...
Andrew L. Pinchuck
AIPS
2006
13 years 11 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...