UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Termination Analysis by Dependency Pairs and Inductive Theorem Proving

Swiderski, S; Parting, M; Giesl, J; Fuhs, C; Schneider-Kamp, P; (2009) Termination Analysis by Dependency Pairs and Inductive Theorem Proving. In: Schmidt, RA, (ed.) (Proceedings) 22nd International Conference on Automated Deduction (CADE-22). (pp. 322-+). SPRINGER-VERLAG BERLIN

Full text not available from this repository.
Type: Proceedings paper
Title: Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Event: 22nd International Conference on Automated Deduction (CADE-22)
Location: McGill Univ, Montreal, CANADA
Dates: 02 August 2009 - 07 August 2009
ISBN-13: 978-3-642-02958-5
Keywords: Science & Technology, Technology, Computer Science, Artificial Intelligence, Computer Science, Software Engineering, Computer Science, PROOFS, FRAMEWORK
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
URI: http://discovery.ucl.ac.uk/id/eprint/1346053
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item