759 search results - page 95 / 152 » Overlap-Free Regular Languages |
233
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. We implemented a ...
141
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Several current research efforts in business process modeling are investigating XML-based executable formal specification languages. The availability of the latter allows modeled...
121
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
133
click to vote
IFIP
2007
Springer
15 years 10 months ago
2007
Springer
The paper deals with the numerical treatment of optimal control problems with bounded distributed controls and elliptic state equations by a wider class of barrier-penalty methods...
132
click to vote
WIA
2007
Springer
15 years 10 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...