Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Logic Programming and Automated Reasoning: International Conference LPAR ' 92, St. Petersburg, Russia, July 15-20, 1992. Proceedings > MIZ-PR: A theorem prover for polymorphic and recursive functions
Logic Programming and Automated Reasoning: International Conference LPAR ' 92, St. Petersburg, Russia, July 15-20, 1992. Proceedings |
Andrei Voronkov
Springer Berlin Heidelberg
Logic Programming and Automated Reasoning: International Conference LPAR ' 92, St. Petersburg, Russia, July 15-20, 1992. Proceedings
MIZ-PR: A theorem prover for polymorphic and recursive functions
Authors

Javier Leach; Susana Nieva

ARI Id

1664708633444_2842658

Access

Not Available Free

Pages

481-483

DOI

10.1007/BFb0013094

Chapter URL

https://rd.springer.com/chapter/10.1007/BFb0013094

Table of Contents of Book
Showing 1 to 20 of 62 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Soundness and completeness of partial deductions for well-founded semantics
Halina Przymusinska; Teodor Przymusinski; Hirohisa Seki
1-12
On deductive planning and the frame problem
Steffen Hölldobler
13-29
On resolution in fragments of classical linear logic (extended abstract)
J. A. Harland; D. J. Pym
30-41
A procedure for automatic proof nets construction
Didier Galmiche; Guy Perrier
42-53
Free logic and infinite constraint networks
James Bowen; Dennis Bahler
54-65
Towards probabilistic knowledge bases
Beat Wüthrich
66-77
Two-level grammar: A functional/logic query language for database and knowledge-base systems
Barrett R. Bryant; Aiqin Pan
78-83
Extending deductive database languages by embedded implications
Burkhard Freitag
84-95
Controlling redundancy in large search spaces: Argonne-style theorem proving through the years
Ewing L. Lusk
96-106
Resolution for many-valued logics
Matthias Baaz; Christian G. Fermüller
107-118
An ordered theory resolution calculus
Peter Baumgartner
119-130
Application of automated deduction to the search for single axioms for exponent groups
William McCune; Larry Wos
131-136
Elementary lower bounds for the lengths of refutations
Hai-Ping Ko; Mark E. Nadel
137-147
Shortening proofs by quantifier introduction
Uwe Egly
148-159
Reform compilation for nonlinear recursion
Håkan Millroth
160-171
Pruning infinite failure branches in programs with occur-check
Ulrich Neumerkel
172-177
The use of planning critics in mechanizing inductive proofs
Andrew Ireland
178-189
λμ-Calculus: An algorithmic interpretation of classical natural deduction
Michel Parigot
190-201
Building proofs by analogy via the Curry-Howard Isomorphism
Thierry Boy de la Tour; Christoph Kreitz
202-213
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 62 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings