Inductive database design
When designing a (deductive) database, the designer has to decide for each predicate (or relation) whether it should be defined extensionally or intensionally, and what the definition should look like. An intelligent system is presented to assist the designer in this task. It starts from an example database in which all predicates are defined extensionally. It then tries to compact the database by transforming extensionally defined predicates into intensionally defined ones. The intelligent system employs techniques from the area of inductive logic programming.
KeywordsLogic for Artificial Intelligence Learning and Knowledge Discovery Database Design Inductive Logic Programming
Unable to display preview. Download preview PDF.
- 1.L. De Raedt and M. Bruynooghe. A theory of clausal discovery. In Proceedings of the 13th International Joint Conference on Artificial Intelligence, pages 1058–1063. Morgan Kaufmann, 1993.Google Scholar
- 2.L. De Raedt and L. Dehaspe. Clausal discovery. Submitted.Google Scholar
- 3.L. De Raedt and S. Džeroski. First order jk-clausal theories are PAC-learnable. Artificial Intelligence, 70:375–392, 1994.Google Scholar
- 4.L. Dehaspe and L. De Raedt. DLAB: a declarative language bias formalism. This volume.Google Scholar
- 5.S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19,20:629–679, 1994.Google Scholar
- 6.G. Plotkin. A note on inductive generalization. In Machine Intelligence, volume 5, pages 153–163. Edinburgh University Press, 1970.Google Scholar
- 7.E. Sommer. Rulebase stratification: an approach to theory restructuring. In S. Wrobel, editor, Proceedings of the 4th International Workshop on Inductive Logic Programming, volume 237 of GMD-Studien, pages 377–390, Sankt Augustin, Germany, 1994. Gesellschaft für Mathematik und Datenverarbeitung MBH.Google Scholar
- 8.W. Van Laer, L. Dehaspe, and L. De Raedt. Applications of a logical discovery engine. In Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, pages 263–274, 1994.Google Scholar