6 search results - page 1 / 2 » Efficient Algorithms for Membership in Boolean Hierarchies o... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability)...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...
ICDT
2009
ACM
14 years 5 months ago
2009
ACM
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analys...
JMLR
2010
12 years 11 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...