A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
type: Item
instance of: scholarly article
title: A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
zbMATH Open document ID: 1078.68158
author: Sumit Gulwani
author: George C. Necula
published in: Information and Computation
publication date: 2005-08-05T00:00:00Z
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 2193212
zbMATH Keywords: Randomized algorithm
zbMATH Keywords: Satisfiability procedure
zbMATH Keywords: Linear arithmetic
zbMATH Keywords: Uninterpreted function symbols
describes a project that uses: CVC Lite
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ic.2004.10.006
OpenAlex ID: W2132620734
cites work: Solvable cases of the decision problem
cites work: Computer Aided Verification
cites work: Q4553256
cites work: Discovering affine equalities using random interpretation
cites work: Q4856179
cites work: Simplification by Cooperating Decision Procedures
cites work: Deciding Combinations of Theories
DOI: 10.1016/J.IC.2004.10.006
Recommended article: A randomized satisfiability procedure for arithmetic and uninterpreted function symbols.
Recommended article: Solving the satisfiability problem by using randomized approach
Recommended article: Q4475671
Recommended article: Probabilistic performance of a heurisic for the satisfiability problem
Recommended article: An exact and a randomized approach for the satisfiability problem
description: scientific article; zbMATH DE number 2193212