Sciweavers

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

14

KI
2009
Springer

favoriteEmaildiscussreport

134views Artificial Intelligence» more KI 2009»

Comparing Unification Algorithms in First-Order Theorem Proving

13 years 11 months ago

Comparing Unification Algorithms in First-Order Theorem Proving

Download www.cs.man.ac.uk

Krystof Hoder, Andrei Voronkov

Real-time Traffic

Artificial Intelligence | KI 2009 |

claim paper

Related Content

» Encoding First Order Proofs in SAT

» An Imperative FirstOrder Calculus with Object Extension

» Test Data Generation for Programs with Quantified FirstOrder Logic Specifications

» First order properties on nowhere dense structures

» Reflecting Proofs in FirstOrder Logic with Equality

» Understanding SPKISDSI Using FirstOrder Logic

» Automated theorem proving in quasigroup and loop theory

» Lambda Logic

» Antiunification Algorithms and Their Applications in Program Analysis

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	KI
Authors	Krystof Hoder, Andrei Voronkov

Comments (0)