Logical analysis of data with decomposable structures.

DOI10.1016/S0304-3975(01)00413-3zbMath1061.68130MaRDI QIDQ1853578

Hirotaka Ono, Toshihide Ibaraki, Kazuhisa Makino

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Artificial intelligenceBoolean functionsApproximation algorithmsLogical analysis of dataDecomposable functions

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

A decomposability index in logical analysis of data ⋮ Recent advances in the theory and practice of logical analysis of data

Cites Work

• Positive and Horn decomposability of partially defined Boolean functions
• Error-free and best-fit extensions of partially defined Boolean functions
• Decomposability of partially defined Boolean functions
• Boosting first-order learning
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Multiway cuts in directed and node weighted graphs
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logical analysis of data with decomposable structures.