93 search results - page 9 / 19 » Nonterminal Complexity of Some Operations on Context-Free La... |
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
SLP
1994
13 years 8 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
DOCENG
2003
ACM
14 years 24 days ago
2003
ACM
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
IJWGS
2006
13 years 7 months ago
2006
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...