ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
58
views
1
references
Top references
cited by
18
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,986
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
9th International Conference on Automated Deduction
The use of explicit plans to guide inductive proofs
other
Author(s):
Alan Bundy
Publication date
(Print):
1988
Publisher:
Springer-Verlag
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH doi match)
oa repository (via OAI-PMH doi match)
oa repository (via OAI-PMH doi match)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Primate Tool Use
Most cited references
1
Record
: found
Abstract
: not found
Article
: not found
Using meta-level inference for selective application of multiple rewrite rule sets in algebraic manipulation
Alan Bundy
,
Bob Welham
(1981)
0
comments
Cited
8
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Pages
: 111-120
DOI:
10.1007/BFb0012826
SO-VID:
9e67e935-bbb5-4804-98fd-e328ce773fd0
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 61
Specifying theorem provers in a higher-order logic programming language
pp. 81
Query processing in quantitative logic programming
pp. 162
A mechanizable induction principle for equational specifications
pp. 278
Procedural interpretation of non-horn logic programs
pp. 538
Canonical conditional rewrite systems
pp. 752
A Prolog technology theorem prover
pp. 768
RRL: A rewrite rule laboratory
pp. 774
The CHIP system : Constraint handling in Prolog
pp. 111
The use of explicit plans to guide inductive proofs
pp. 415
SATCHMO: A theorem prover implemented in Prolog
pp. 500
A resolution calculus for modal logics
Similar content
2,986
Activation of endodontic irrigants using a 9.3 µm CO₂ and diode lasers: A laboratory proof of concept model.
Authors:
Clara I Anton Y Otero
,
Laurine Marger
,
Enrico Di Bella
…
Towards A Universally Usable Human Interaction Proof
Authors:
Graig Sauer
,
Jonathan Lazar
,
Harry Hochheiser
…
Explicit and Implicit Constrained-Space Probabilistic Threshold Range Queries for Moving Objects
Authors:
Minyi Guo
,
Bin Yao
,
Zhi Wang
See all similar
Cited by
18
Conjecture Synthesis for Inductive Theories
Authors:
Alan Bundy
,
Lucas Dixon
,
Moa Johansson
A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
Authors:
Yutaka Nagashima
,
Ramana Kumar
Reconstructing proofs at the assertion level
Authors:
Xiaorong Huang
See all cited by