Structure identification in relational data
- 31 December 1992
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 58 (1-3), 237-270
- https://doi.org/10.1016/0004-3702(92)90009-m
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Decomposing a relation into a tree of binary relationsJournal of Computer and System Sciences, 1990
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- A theory of the learnableCommunications of the ACM, 1984
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974
- Approximating discrete probability distributions with dependence treesIEEE Transactions on Information Theory, 1968