3-part types of approximations: approximation on input,KB,method
- general list of approximation properties by Cadoli/Schaerf
KWeb deliverable D2.1.1. general examples of each category,
- very general, not specific to semantic web, only give references + one-sentence descriptions
such approximations can be anytime or not
specific list of anytime properties by Zilberstein
- (are probabilistic guarantees on these properties sufficient?)
TODO: any relation between C&S properties and Zilberstein properties?
?SemWeb specific approximations
- Screech (disjunctions as conjuctions)
- Instance Store (role-free A-boxes)
- RIO (select consistent axiom subsets of KB)
- Cadoli/Schaerf (select vocabulary subset of KB, Pan08?)
- Zharko (remove conjuncts based on Google-distance)
- Pan (knowledge compilation towards a less expressive logic)
- Stuckenschmdit'02 (query approximation)
- TODO: search for more (ESSLI cursus?)
- score each of these on "which of 3 types" and "anytime yes/no/why" TODO: think about LarKC requirements
- distributed architecture: 0 coverage
- storage and retrieval (roughly: size and expressivity of KB): small coverage
- knowledge compilation for expressivity
- KB approximations for large KBs
- reasoning architecture: good coverage
- iterating reasong and search: ex. RIO
- trade quality for cost: anytime behaviour
- incompleteness and soundness
- varying quality and scale: anytime behaviour
- fast respons on large KB: anytime behaviour
- large numbers of axioms and facts NOT: changing facts, probabilistic techniques, non-logic-based
