Skip to main content
Journal Article

Combining sets with elements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2772 762-782
DOI: 10.1007/978-3-540-39910-0_33
18Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We address the problem of combining decision procedures for sets with decision procedures for objects that are not (necessarily) sets. We present Nelson-Oppen-based and tableau-based combination methods, we prove their correctness, analyze their complexity, and we describe heuristics that aim for efficiency. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Zarba, C. G. (2004). Combining sets with elements. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2772, 762–782. https://doi.org/10.1007/978-3-540-39910-0_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free