|
8
|
Formal proofs about rewriting using ACL2
– José-luis Ruiz-reina, José-antonio Alonso, María-josé Hidalgo, Francisco-jesús Martín-mateos
- 2002
|
|
10
|
Towards Self-verification of HOL Light
– John Harrison
- 2006
|
|
301
|
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
– John Mccarthy
- 1960
|
|
228
|
Computer-Aided Reasoning: An Approach
– M Kaufmann, P Manolios, J S Moore
- 2000
|
|
46
|
Metatheory and Reflection in Theorem Proving: A Survey and Critique
– John Harrison
- 1995
|
|
2
|
Formal verification of a generic framework to synthesize SAT–provers
– F J Martín, J A Alonso, M J Hidalgo, J L Ruiz
|
|
2
|
A certified polynomial-based decision procedure for propositional logic
– I Medina, F Palomo, J A Alonso
- 2001
|
|
2
|
Verified computer algebra in ACL2. Gröbner bases computation
– I Medina, F Palomo, J A Alonso, J L Ruiz
- 2004
|
|
27
|
Abstract datatypes in PVS
– S Owre, N Shankar
- 1993
|
|
120
|
Attributive concept descriptions with complements
– M Schmidt-Schauss, G Smolka
- 1991
|
|
491
|
PVS: A Prototype Verification System
– S. Owre, J. M. Rushby, N. Shankar
- 1992
|
|
4
|
Formalizing basic first order model theory
– John Harrison
- 1998
|
|
1
|
Algorithms dor constraint in deduction and knowledge representation
– W Nutt
- 1993
|
|
3
|
An inductive proof of the wellfoundedness of the mulitset order. http://www4.informatik.tu-muenchen.de/~nipkow/misc/ index.html
– T Nipkow
- 1998
|
|
7
|
PVS Language Reference
– Version September Owre, S. Owre, N. Shankar, J. M. Rushby, D. W. J. Stringer-calvert
|
|
115
|
Complexity Results and Practical Algorithms for Logics in Knowledge Representation
– Stephan Tobies
- 2001
|
|
16
|
Pellet system description
– Evren Sirin, Bijan Parsia
- 2006
|
|
1
|
A finite first-order presentation of set theory
– S Vaillant
|
|
2
|
Fellowship: who needs a manual anyway
– F Kirchner
- 2005
|
