Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

FLAIRS
2006

favoriteEmaildiscussreport

140views Artificial Intelligence» more FLAIRS 2006»

Automated Generation of Interesting Theorems

14 years 7 days ago

Automated Generation of Interesting Theorems

Download www.aaai.org

In the logical theory of a set of axioms there are many boring logical consequences, and scattered among them there are a few interesting ones. The few interesting ones include those that are singled out as theorems by experts in the domain. This paper describes the techniques, implementation, and results of an automated system that generates logical consequences of a set of axioms, and uses filters and ranking to identify interesting theorems among the logical consequences.

Yury Puzis, Yi Gao, Geoff Sutcliffe

Real-time Traffic

Artificial Intelligence | Boring Logical Consequences | FLAIRS 2006 | Interesting Ones | Logical Consequences |

claim paper

Related Content

» Automated Theorem Proving in Incidence Geometry A Bracket Algebra Based Elimination Metho...

» Identifying PreConditions with the ZEVES Theorem Prover

» Automated theorem proving by resolution in nonclassical logics

» Automatic Generation of Classification Theorems for Finite Algebras

» Automated Design of Image Operators that Detect Interest Points

» Automatically Generating Counterexamples to Naive Free Theorems

» Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models

» An Empirical Evaluation of Automated Theorem Provers in Software Certification

» Reasoning by Symmetry and Function Ordering in Finite Model Generation

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2006
Where	FLAIRS
Authors	Yury Puzis, Yi Gao, Geoff Sutcliffe

Comments (0)