Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
16
views
44
references
Top references
cited by
3
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,013
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
10th International Conference on Automated Deduction
A theorem prover for a computational logic
other
Author(s):
Robert S. Boyer
,
J Strother Moore
Publication date
(Online):
June 9 2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
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
Computational epistasis
Most cited references
44
Record
: found
Abstract
: not found
Article
: not found
The Byzantine Generals Problem
Leslie Lamport
,
Robert Shostak
,
Marshall Pease
(1982)
0
comments
Cited
523
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
An axiomatic basis for computer programming
C. Hoare
(1969)
0
comments
Cited
371
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Reaching Agreement in the Presence of Faults
M. Pease
,
R. Shostak
,
L. Lamport
(1980)
0
comments
Cited
171
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1990
Publication date (Online):
June 9 2005
Pages
: 1-15
DOI:
10.1007/3-540-52885-7_75
SO-VID:
2d8a8cbc-95ed-4eb5-8304-9e4c7049a321
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
A theorem prover for a computational logic
pp. 28
Parallelizing the closure computation in automated deduction
pp. 40
Partheo: A high-performance parallel theorem prover
pp. 72
Automatic theorem proving in paraconsistent logics: Theory and implementation
pp. 147
Guiding induction proofs
pp. 178
A resolution principle for clauses with constraints
pp. 193
Str+ve \(\subseteq\) : The Str+ve-based subset prover
pp. 207
Ritt-Wu's decomposition algorithm and geometry theorem proving
pp. 292
Unification in a combination of equational theories: an efficient algorithm
pp. 427
On restrictions of ordered paramodulation with simplification
pp. 442
Simultaneous paramodulation
pp. 543
Computing prime implicants
pp. 641
The TPS theorem proving system
pp. 663
Otter 2.0
pp. 221
Encoding a dependent-type λ-calculus in a logic programming language
pp. 647
The OYSTER-CLAM system
Similar content
2,013
Formalizing Automated Market Makers in the Lean 4 Theorem Prover
Authors:
Daniele Pusceddu
,
Massimo Bartoletti
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover
Authors:
Laura Kovacs
,
Andrei Voronkov
Translating Mizar for First Order Theorem Provers
Authors:
Josef Urban
See all similar
Cited by
3
Zeno: An Automated Prover for Properties of Recursive Data Structures
Authors:
William Sonnex
,
Sophia Drossopoulou
,
Susan Eisenbach
Reasoning on Schemata of Formulae
Authors:
Nicolas Peltier
,
Mnacho Echenim
A Framework for the Verification of Certifying Computations
Authors:
Eyad Alkassar
,
Sascha Böhme
,
Kurt Mehlhorn
…
See all cited by