1,859 research outputs found
Identification of Design Principles
This report identifies those design principles for a (possibly new) query and transformation
language for the Web supporting inference that are considered essential. Based upon these
design principles an initial strawman is selected. Scenarios for querying the Semantic Web
illustrate the design principles and their reflection in the initial strawman, i.e., a first draft of
the query language to be designed and implemented by the REWERSE working group I4
Equivalence Classes of Staged Trees
In this paper we give a complete characterization of the statistical
equivalence classes of CEGs and of staged trees. We are able to show that all
graphical representations of the same model share a common polynomial
description. Then, simple transformations on that polynomial enable us to
traverse the corresponding class of graphs. We illustrate our results with a
real analysis of the implicit dependence relationships within a previously
studied dataset.Comment: 18 pages, 4 figure
Inference of Shape Graphs for Graph Databases
We investigate the problem of constructing a shape graph that describes the structure of a given graph database. We employ the framework of grammatical inference, where the objective is to find an inference algorithm that is both sound, i.e., always producing a schema that validates the input graph, and complete, i.e., able to produce any schema, within a given class of schemas, provided that a sufficiently informative input graph is presented. We identify a number of fundamental limitations that preclude feasible inference. We present inference algorithms based on natural approaches that allow to infer schemas that we argue to be of practical importance
Decision problems for Clark-congruential languages
A common question when studying a class of context-free grammars is whether
equivalence is decidable within this class. We answer this question positively
for the class of Clark-congruential grammars, which are of interest to
grammatical inference. We also consider the problem of checking whether a given
CFG is Clark-congruential, and show that it is decidable given that the CFG is
a DCFG.Comment: Version 2 incorporates revisions prompted by the comments of
anonymous referees at ICGI and LearnAu
- âŠ