Sciweavers

35 search results - page 5 / 7
» Contextual hyperedge replacement
Sort
View
ALT
2003
Springer
14 years 5 days ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
CADE
2005
Springer
13 years 10 months ago
The CoRe Calculus
We present the CoRe calculus for contextual reasoning which supports reasoning directly at the assertion level, where proof steps are justified in terms of applications of defini...
Serge Autexier
TAMC
2007
Springer
14 years 2 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
GG
2004
Springer
14 years 1 months ago
Parsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
Sebastian Seifert, Ingrid Fischer
AGTIVE
2003
Springer
14 years 1 months ago
Modeling Discontinuous Constituents with Hypergraph Grammars
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can ...
Ingrid Fischer