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
36
views
11
references
Top references
cited by
17
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,647
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Logic for Programming, Artificial Intelligence, and Reasoning
Splitting on Demand in SAT Modulo Theories
other
Author(s):
Clark Barrett
,
Robert Nieuwenhuis
,
Albert Oliveras
,
Cesare Tinelli
Publication date
(Print):
2006
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
Bristol University Press: COVID-19
Most cited references
11
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
Simplification by Cooperating Decision Procedures
Greg Nelson
,
Derek Oppen
(1979)
0
comments
Cited
102
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 512-526
DOI:
10.1007/11916277_35
SO-VID:
1040426b-630b-4200-95a7-9d4a34e43a5f
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 272
Reducing Nondeterminism in the Calculus of Structures
pp. 302
On Locally Checkable Properties
pp. 527
Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis
pp. 75
Derivational Complexity of Knuth-Bendix Orders Revisited
pp. 242
A Local System for Intuitionistic Logic
pp. 497
Theory Instantiation
pp. 512
Splitting on Demand in SAT Modulo Theories
pp. 572
Lemma Learning in the Model Evolution Calculus
Similar content
2,647
MiniMaxSAT: An Efficient Weighted Max-SAT solver
Authors:
F. Heras
,
J. Larrosa
,
A Oliveras
…
Do Teacher Unions Hinder Educational Performance?: Lessons Learned from State SAT and ACT Scores
Authors:
Lala Carr Steelman
,
Robert M. Carini
,
Brian Powell
Fast sampling of satisfying assignments from random \(k\)-SAT
Authors:
Andreas Galanis
,
Leslie Ann Goldberg
,
Heng Guo
…
See all similar
Cited by
16
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
Authors:
Guy Katz
,
Clark Barrett
,
David Dill
…
CVC3
Authors:
Clark Barrett
,
Cesare Tinelli
Satisfiability Modulo Theories
Authors:
Clark Barrett
,
Cesare Tinelli
See all cited by