Result 1 to 20 of 65 total
Conjecture synthesis for inductive theories. (English)
J. Autom. Reasoning 47, No. 3, 251-289 (2011).
1
Towards formal proof script refactoring. (English)
Davenport, James H. (ed.) et al., Intelligent computer mathematics. 18th symposium, Calculemus 2011, and 10th international conference, MKM 2011, Bertinoro, Italy, July 18‒23, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22672-4/pbk). Lecture Notes in Computer Science 6824. Lecture Notes in Artificial Intelligence, 260-275 (2011).
2
All tree-level amplitudes in massless QCD. (English)
J. High Energy Phys. 2011, No. 1, 035, 43 p., electronic only (2011).
3
Towards formal proof script refactoring (English)
Calculemus/MKM, 260-275 (2011).
4
Scheme-based synthesis of inductive theories. (English)
Sidorov, Grigori (ed.) et al., Advances in artificial intelligence. 9th Mexican international conference on artificial intelligence, MICAI 2010, Pachuca, Mexico, November 8‒13, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-16760-7/pbk). Lecture Notes in Computer Science 6437. Lecture Notes in Artificial Intelligence, 348-361 (2010).
5
Dynamic rippling, middle-out reasoning and lemma discovery. (English)
Siegler, Simon (ed.) et al., Verification, induction, termination analysis. Festschrift for Christoph Walther on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-17171-0/pbk). Lecture Notes in Computer Science 6463. Lecture Notes in Artificial Intelligence, 102-116 (2010).
6
Case-analysis for rippling and inductive proof. (English)
Kaufmann, Matt (ed.) et al., Interactive theorem proving. First international conference, ITP 2010, Edinburgh, UK, July 11‒14, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14051-8/pbk). Lecture Notes in Computer Science 6172, 291-306 (2010).
7
Open graphs and computational reasoning (English)
DCM, 169-180 (2010).
8
Scheme-based synthesis of inductive theories (English)
MICAI (1), 348-361 (2010).
9
Case-analysis for rippling and inductive proof (English)
ITP, 291-306 (2010).
10
Dynamic rippling, middle-out reasoning and lemma discovery (English)
Verification, Induction, Termination Analysis, 102-116 (2010).
11
Graphical reasoning in compact closed categories for quantum computation. (English)
Comput. Res. Repos. 2009, Article No. 0902.0514 (2009).
12
Graphical reasoning in compact closed categories for quantum computation. (English)
Ann. Math. Artif. Intell. 56, No. 1, 23-42 (2009).
13
Intelligent computer mathematics. 16th symposium, Calculemus 2009, 8th international conference, MKM 2009, held as part of CICM 2009, Grand Bend, Canada, July 6‒12, 2009. Proceedings. (English)
Lecture Notes in Computer Science 5625. Lecture Notes in Artificial Intelligence. Berlin: Springer (ISBN 978-3-642-02613-3/pbk). xix, 493~p. EUR~69.50 (2009).
14
Plans, actions and dialogues using linear logic. (English)
J. Logic Lang. Inf. 18, No. 2, 251-289 (2009).
15
Automatic differentiation: calculation of the Hessian (English)
Encyclopedia of Optimization, 133-137 (2009).
16
Automatic differentiation: calculation of Newton steps (English)
Encyclopedia of Optimization, 137-142 (2009).
17
Extending graphical representations for compact closed categories with applications to symbolic quantum computation. (English)
Autexier, Serge (ed.) et al., Intelligent computer mathematics. 9th international conference, AISC 2008, 15th symposium, Calculemus 2008, 7th international conference, MKM 2008, Birmingham, UK, July 28‒August 1, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85109-7/pbk). Lecture Notes in Computer Science 5144. Lecture Notes in Artificial Intelligence, 77-92 (2008).
18
Extending graphical representations for compact closed categories with applications to symbolic quantum computation (English)
AISC/MKM/Calculemus, 77-92 (2008).
19
Constructing induction rules for deductive synthesis proofs. (English)
Electron. Notes Theor. Comput. Sci. 153, No. 1, 3-21 (2006).
20
Result 1 to 20 of 65 total
Start
Contact
Print
General Help
