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
93
views
89
references
Top references
cited by
23
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,122
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Handbook of Model Checking
Satisfiability Modulo Theories
other
Author(s):
Clark Barrett
,
Cesare Tinelli
Publication date
(Online):
May 19 2018
Publisher:
Springer International Publishing
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
ScienceOpen Research
Most cited references
89
Record
: found
Abstract
: not found
Article
: not found
A machine program for theorem-proving
Martin Davis
,
George Logemann
,
Donald Loveland
(1962)
0
comments
Cited
305
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Computing Procedure for Quantification Theory
Martin Davis
,
Hilary Putnam
(1960)
0
comments
Cited
222
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Efficiency of a Good But Not Linear Set Union Algorithm
Robert Tarjan
(1975)
0
comments
Cited
126
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2018
Publication date (Online):
May 19 2018
Pages
: 305-343
DOI:
10.1007/978-3-319-10575-8_11
SO-VID:
63909d26-a93e-452b-b53c-e41614adcab8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 305
Satisfiability Modulo Theories
pp. 871
The mu-calculus and Model Checking
Similar content
1,122
Satisfiability for MTL and TPTL over Non-monotonic Data Words
Authors:
Claudia Carapelle
,
S Feng
,
O. Gil
…
Lifting the Cartier transform of Ogus-Vologodsky modulo \(p^n\)
Authors:
Daxin Xu
Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics⋆
Authors:
Edgar Martinez-Moro
,
F. JavierGalán-Simón
,
MiguelA. Borges-Trenard
…
See all similar
Cited by
23
Minimising Deterministic Büchi Automata Precisely Using SAT Solving
Authors:
Rüdiger Ehlers
A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders
Authors:
FRANCESCO CALIMERI
,
FRANCESCO CAUTERUCCIO
,
LUCA CINELLI
…
On the Virtue of Patience: Minimizing Büchi Automata
Authors:
Rüdiger Ehlers
,
Bernd Finkbeiner
See all cited by