Sciweavers

2944 search results - page 235 / 589
» On Well Quasi-orders on Languages
Sort
View
EACL
1993
ACL Anthology
15 years 8 months ago
Mathematical Aspects of Command Relations
In gb, the importance of phrase-structure rules has dwindled in favour of nearness conditions. Today, nearness conditions play a major role in defining the correct linguistic rep...
Marcus Kracht
ACL
1990
15 years 7 months ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch
APLAS
2010
ACM
15 years 6 months ago
Model Independent Order Relations for Processes
Semantic preorders between processes are usually applied in practice to model approximation or implementation relationships. For interactive models these preorders depend crucially...
Chaodong He
APLAS
2010
ACM
15 years 6 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
DEBU
2008
123views more  DEBU 2008»
15 years 6 months ago
Pathfinder: XQuery Off the Relational Shelf
The Pathfinder project makes inventive use of relational database technology--originally developed to process data of strictly tabular shape--to construct efficient database-suppo...
Torsten Grust, Jan Rittinger, Jens Teubner