Abstract
This paper discusses an approach to representing and reasoning about constraints over strings. We discuss how string domains can often be concisely represented using regular languages, and how constraints over strings, and domain operations on sets of strings, can be carried out using this representation. © Springer-Verlag 2003.
Cite
CITATION STYLE
APA
Golden, K., & Pang, W. (2003). Constraint Reasoning over Strings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 377–391. https://doi.org/10.1007/978-3-540-45193-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free