Name
Abstract | ||
|---|---|---|
. We present a logical approach to graph theoretical learningthat is based on using alphabetic substitutions for modelling graphmorphisms. A classified graph is represented by a definite clause thatpossesses variables of the sort node for representing nodes and atoms forrepresenting the edges. In contrast to the standard logical semantics, differentnode variables are assumed to denote different objects. The use ofan alphabetical subsumption relation (ff-subsumption) implies that... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/3540635149_46 | ILP |
Keywords | Field | DocType |
logical framework,graph theoretical decision tree,decision tree learning | Decision tree,Definite clause grammar,Computer science,Theoretical computer science,Artificial intelligence,ID3 algorithm,Logical framework,Graph theory,Inductive logic programming,Discrete mathematics,Tree decomposition,Machine learning,Decision tree learning | Conference |
ISBN | Citations | PageRank |
3-540-63514-9 | 7 | 0.50 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Geibel | 1 | 286 | 26.62 |
| Fritz Wysotzki | 2 | 456 | 45.46 |