Sciweavers

301 search results - page 9 / 61
» On extensions of a theorem of Baxter
Sort
View
TABLEAUX
2000
Springer
13 years 11 months ago
MSPASS: Modal Reasoning by Translation and First-Order Resolution
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...
Ullrich Hustadt, Renate A. Schmidt
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
ECLIPSE
2006
ACM
14 years 1 months ago
Visualization of clone detection results
The goal of a clone detection tool is to identify sections of code that are duplicated in a program. The result of the detection is presented in some manner for the user to view, ...
Robert Tairas, Jeff Gray, Ira D. Baxter
CADE
2008
Springer
14 years 7 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 8 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