NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Constraint Reasoning Over StringsThis 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.
Document ID
20030054480
Acquisition Source
Ames Research Center
Document Type
Preprint (Draft being sent to journal)
Authors
Koga, Dennis (NASA Ames Research Center Moffett Field, CA, United States)
Golden, Keith (NASA Ames Research Center Moffett Field, CA, United States)
Pang, Wanlin (QSS Group, Inc. Moffett Field, CA, United States)
Date Acquired
September 7, 2013
Publication Date
April 15, 2003
Subject Category
Systems Analysis And Operations Research
Meeting Information
Meeting: Constraint Programming 2003
Location: Kinsale
Country: Ireland
Start Date: September 9, 2003
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

There are no records associated with this record.
No Preview Available