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
29
views
15
references
Top references
cited by
11
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,474
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Formal Methods: Foundations and Applications
Satisfiability Modulo Theories: An Appetizer
other
Author(s):
Leonardo de Moura
,
Nikolaj Bjørner
Publication date
(Print):
2009
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
ScienceOpen Research
Most cited references
15
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
Simplification by Cooperating Decision Procedures
Greg Nelson
,
Derek Oppen
(1979)
0
comments
Cited
102
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Yeting Ge
,
Leonardo de Moura
(2009)
0
comments
Cited
42
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 23-36
DOI:
10.1007/978-3-642-10452-7_3
SO-VID:
7765ebfa-d877-4e13-a775-2b725a2d7db7
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 23
Satisfiability Modulo Theories: An Appetizer
pp. 84
Corecursive Algebras: A Study of General Structured Corecursion
Similar content
1,474
Appetizer or Main Course: Early Market vs. Majority Market Go-to-Market Strategies for Radical Innovations
Authors:
Monika Schuhmacher
,
Sabine Kuester
,
Erik Hultink
Studies on effect of irradiation on functional properties of two ready-to-drink appetizer beverages and their shelf lives
Authors:
Dadasaheb
,
Dadasaheb Wadikar
,
C.R. Vasudish
…
Experience with an appetizing, high protein, low folate diet in man.
Authors:
R. Hillman
,
June Eichner
,
N Buergel
See all similar
Cited by
11
Incremental proxy re-encryption scheme for mobile cloud computing environment
Authors:
Sajjad A. Madani
,
M. Kiah
,
Abdul Nasir Khan
…
SeDaSC: Secure Data Sharing in Clouds
Authors:
Albert Y Zomaya
,
Keqin Kathy Li
,
Athanasios V Vasilakos
…
BSS: block-based sharing scheme for secure data storage services in mobile cloud environment
Authors:
Abdul Nasir Khan
,
M. Kiah
,
Mazhar Ali
…
See all cited by