Sciweavers

2834 search results - page 11 / 567
» Representing Trees with Constraints
Sort
View
IWPC
2003
IEEE
14 years 2 months ago
YAAB (Yet Another AST Browser): Using OCL to Navigate ASTs
In the last decades several tools and environments defined and introduced languages for querying, navigating sforming abstract syntax trees. These environments were meant to supp...
Giuliano Antoniol, Massimiliano Di Penta, Ettore M...
ICML
1996
IEEE
14 years 9 months ago
Representing and Learning Quality-Improving Search Control Knowledge
Generating good, production-quality plans is an essential element in transforming planners from research tools into real-world applications, but one that has been frequently overl...
M. Alicia Pérez
SAS
1999
Springer
14 years 1 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
IS
2010
13 years 7 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
SEMWEB
2005
Springer
14 years 2 months ago
Representing Web Service Policies in OWL-DL
Abstract. Recently, there have been a number of proposals for languages for expressing web service constraints and capabilities, with WSPolicy and WSPL leading the way. The propose...
Vladimir Kolovski, Bijan Parsia, Yarden Katz, Jame...