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
34
views
7
references
Top references
cited by
14
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,236
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Reasoning
Satallax: An Automatic Higher-Order Prover
other
Author(s):
Chad E. Brown
Publication date
(Print):
2012
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
Higher order chromatin architecture
Most cited references
7
Record
: found
Abstract
: not found
Article
: not found
The TPTP Problem Library and Associated Infrastructure
Geoff Sutcliffe
(2009)
0
comments
Cited
75
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Satisfiability modulo theories
Leonardo de Moura
,
Nikolaj Bjørner
(2011)
0
comments
Cited
39
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Extending Sledgehammer with SMT Solvers
Jasmin Christian Blanchette
,
Sascha Böhme
,
Lawrence Paulson
(2011)
0
comments
Cited
12
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 111-117
DOI:
10.1007/978-3-642-31365-3_11
SO-VID:
825235cb-35d7-436b-a60b-058a79f331f7
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 477
Fingerprint Indexing for Paramodulation and Rewriting
pp. 111
Satallax: An Automatic Higher-Order Prover
pp. 225
Proving Non-looping Non-termination Automatically
pp. 286
δ-Complete Decision Procedures for Satisfiability over the Reals
pp. 355
Inprocessing Rules
pp. 378
Overview and Evaluation of Premise Selection Techniques for Large Theory Mathematics
pp. 454
The QMLTP Problem Library for First-Order Modal Logics
pp. 484
Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
pp. 537
A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance
Similar content
1,236
Verified heap theorem prover by paramodulation
Authors:
Gordon Stewart
,
Lennart Beringer
,
Andrew W. Appel
Metamath Zero: Designing a Theorem Prover Prover
Authors:
Mario Carneiro
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover
Authors:
Laura Kovacs
,
Andrei Voronkov
See all similar
Cited by
14
Learning-Assisted Automated Reasoning with Flyspeck
Authors:
Josef Urban
,
Cezary Kaliszyk
MaSh: Machine Learning for Sledgehammer
Authors:
Daniel Kühlwein
,
Jasmin Christian Blanchette
,
Cezary Kaliszyk
…
Theorem Proving in Large Formal Mathematics as an Emerging AI Field
Authors:
Josef Urban
,
Jiří Vyskočil
See all cited by