Engineering PapersSearch

NASA NTRS · 20030054480

Constraint Reasoning Over Strings

Abstract

This paper discusses an approach to representing and reasoning about constraints over strings. We discuss how many 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.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Koga, Dennis, Golden, Keith, Pang, Wanlin. 2003-04-15. Constraint Reasoning Over Strings. https://ntrs.nasa.gov/citations/20030054480

Cite the original work for its findings. Save a collection to share your selection of sources.