Result: A randomized satisfiability procedure for arithmetic and uninterpreted function symbols

Title:
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
Authors:
GULWANI, Sumit, NECULA, George C
Source:
Automated deduction - CADE-19 (Miami Beach FL, 28 July - 2 August 2003)Lecture notes in computer science. :167-181
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 9 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Logiciel, Software, Généralités, General, Algorithme compétitif, Competitive algorithms, Algorithme déterministe, Deterministic algorithms, Algorithme randomisé, Randomized algorithm, Algoritmo aleatorizado, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Calcul symbolique, Symbolic computation, Cálculo simbólico, Défaillance, Failures, Fallo, Démonstration automatique, Automatic proving, Demostración automática, Ensemble aléatoire, Random set, Conjunto aleatorio, Performance algorithme, Algorithm performance, Resultado algoritmo, Plan randomisé, Randomized design, Plan aleatorizado, Randomisation, Randomization, Aleatorización, Satisfaisabilité, Satisfiability, Satisfactoriabilidad, Variable aléatoire, Random variable, Variable aléatoria
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of California, Berkeley, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15690689
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15690689
Database:
PASCAL Archive

Further Information

We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to maintain at all times a set of random variable assignments that satisfy the literals seen so far. We prove that this algorithm is complete (i.e., it identifies all unsatisfiable conjunctions) and is probabilistically sound (i.e., the probability that it fails to identify satisfiable conjunctions is very small). The algorithm has the ability to retract assumptions incrementally with almost no additional space overhead. The key advantage of the algorithm is its simplicity. We also show experimentally that the randomized algorithm has performance competitive with the existing deterministic symbolic algorithms.