Engineering DPLL(T) + Saturation (Q3541724)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Engineering DPLL(T) + Saturation	scientific article

Statements

scholarly article

0 references

Engineering DPLL(T) + Saturation (English)

0 references

Leonardo de Moura

0 references

Nikolaj Bjørner

0 references

Automated Reasoning

0 references

publication date

27 November 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-71070-7_40

0 references

Solving SAT and SAT Modulo Theories

0 references

Simplify: a theorem prover for program checking

0 references

Solving Quantified Verification Conditions Using Satisfiability Modulo Theories

0 references

E-matching for Fun and Profit

0 references

Automated Reasoning

0 references

0 references

0 references

Substitution tree indexing

0 references

Simple and Efficient Clause Subsumption with Feature Vector Indexing

0 references

An algorithm for finding canonical sets of ground rewrite rules in polynomial time

0 references

0 references

0 references

Integrating Linear Arithmetic into Superposition Calculus

0 references

Labelled Splitting

0 references

New results on rewrite-based satisfiability procedures

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-71070-7_40

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3541724

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3541724&oldid=35082813"