Structure identification in relational data
type: Item
instance of: scholarly article
title: Structure identification in relational data
zbMATH Open document ID: 0782.68095
DOI: 10.1016/0004-3702(92)90009-M
author: Rina Dechter
author: Judea Pearl
published in: Artificial Intelligence
publication date: 1993-04-01T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 146357
zbMATH Keywords: \(k\)-Horn approximation
zbMATH Keywords: identifiability
zbMATH Keywords: Horn theory
MaRDI profile type: Publication
cites work: Queries and concept learning
cites work: Learning conjunctions of Horn clauses
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: On the Desirability of Acyclic Database Schemes
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Approximating discrete probability distributions with dependence trees
cites work: Q4138187
cites work: Decomposing a relation into a tree of binary relations
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Tree clustering for constraint networks
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q3992609
cites work: Q5572802
cites work: Q3668890
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Q4028818
cites work: A theory of the learnable
cites work: The Semantics of Predicate Logic as a Programming Language
description: scientific article; zbMATH DE number 146357