A Regular Language Membership Constraint for Finite Sequences of Variables

A Regular Language Membership Constraint for Finite Sequences of Variables

This paper describes a global constraint on a fixed-length sequence of finite-domain variables requiring that the corresponding sequence of values taken by these variables belong to a given regular language, thereby generalizing some other known global constraints. We describe and analyze a filterin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Pesant, Gilles
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Constraint Programming
Constraint Satisfaction Problem
Exact sciences and technology
Global Constraint
Logical, boolean and switching functions
Regular Expression
Regular Language
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper describes a global constraint on a fixed-length sequence of finite-domain variables requiring that the corresponding sequence of values taken by these variables belong to a given regular language, thereby generalizing some other known global constraints. We describe and analyze a filtering algorithm achieving generalized arc consistency for this constraint. Some comparative empirical results are also given.
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-30201-8_36