Sciweavers

90 search results - page 2 / 18
» Automated theorem proving in quasigroup and loop theory
Sort
View
CADE
2007
Springer
13 years 11 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
CSL
2004
Springer
13 years 11 months ago
Unsound Theorem Proving
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
Christopher Lynch
JAIR
2011
103views more  JAIR 2011»
13 years 14 days 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
FLAIRS
2003
13 years 6 months ago
Proving Harder Theorems by Axiom Reduction
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...
Geoff Sutcliffe, Alexander Dvorský
CADE
2007
Springer
14 years 5 months ago
Logical Interpretation: Static Program Analysis Using Theorem Proving
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
Ashish Tiwari, Sumit Gulwani