Efficient Theta-Subsumption Based on Graph Algorithms.
Tobias SchefferRalf HerbrichFritz WysotzkiPublished in: Inductive Logic Programming Workshop (1996)
Keyphrases
- computationally efficient
- computationally expensive
- algorithmic solutions
- data structure
- maximum flow
- computationally intensive
- highly efficient
- efficient implementation
- structured data
- optimization problems
- description logics
- computational complexity
- random walk
- graphical models
- directed graph
- worst case
- computational cost
- significant improvement
- depth first search
- decision trees
- computationally complex