A short survey of automated reasoning

Cached

Download Links

by John Harrison
Citations:2 - 0 self

Documents Related by Co-Citation

63 Probability Theory of Classical Euclidean Optimization Problems – J Yukich - 1998
2 Janssens – An algorithm to generate all spanning trees of a graph in order of increasing cost – Kenneth Sörensen, Gerrit K. Janssens - 2003
6 An Eulerian trail through Königsberg – R J Wilson - 1986
2 Robust and Parallel Solving of a Network – Claude Le Pape, Laurent Perron, Jean-Charles Regin, Paul Shaw
1 Ting Wang,” Analysis and Application of the Optimal – Junru Cao, Zhenbai Song, Van Wang
1 Wojciech Zabierowski, Andrzej Napieralski, “Graph Theory and Web Technologies Application for Train Timetable Database Handling – Anna Kopka - 2007
1 Cherkassky,Andrew V. Goldberg,Tomasz radzik ,”Shortest Paths Algorithms: Theory and Experimental Evaluation”,pp – V Boris - 1996
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
439 On the shortest spanning subtree of a graph and the traveling salesman problem – J B Kruskal - 1956
272 The traveling salesman problem: A case study – David S Johnson, Lyle A Mcgeoch - 1997
526 Algebraic Graph Theory – N Biggs
3 A new implementation of Automath – Freek Wiedijk
3 Paramodulation-based thorem proving – Robert Nieuwenhuis, Alberto Rubio - 2001
3 Proof Assistants: history, ideas and future – H. Geuvers, Gl Nijmegen
2 Social Processes, Program Verification and All That – Andrea Asperti, et al. - 2009
8 About the formalization of some results by Chebyshev in number theory – Andrea Asperti, Wilmer Ricciotti, Mura Anteo Zamboni - 2009
3 Smart matching – Andrea Asperti, Enrico Tassi
2 José Meseguer, and Prasanna Thati. Narrowing and rewriting logic: from foundations to applications – Santiago Escobar
6 Estimating the Cost of a Standard Library for a Mathematical Proof Checker. http://www.cs.kun.nl/~freek/notes – Freek Wiedijk