Sciweavers

300 search results - page 9 / 60
» Extension of a theorem of Whitney
Sort
View
JAIR
2011
103views more  JAIR 2011»
13 years 2 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
CADE
2008
Springer
14 years 8 months ago
Combining Theorem Proving with Natural Language Processing
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...
Björn Pelzer, Ingo Glöckner
PSSS
2003
13 years 9 months ago
Extending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
Tanel Tammet
APAL
2008
83views more  APAL 2008»
13 years 7 months ago
Easton's theorem and large cardinals
The continuum function F on regular cardinals is known to have great freedom; if , are regular cardinals, then F needs only obey the following two restrictions: (1) cf(F()) > ...
Sy D. Friedman, Radek Honzik
ENTCS
2007
83views more  ENTCS 2007»
13 years 7 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