Logical analysis of binary data with missing bits
- 28 February 1999
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 107 (2) , 219-263
- https://doi.org/10.1016/s0004-3702(98)00110-6
Abstract
No abstract availableKeywords
Funding Information
- Office of Naval Research (N00014-92-J-1375, N00014-92-J-4083)
- Ministry of Education, Culture, Sports, Science and Technology (06044112)
This publication has 26 references indexed in Scilit:
- Knowing what doesn't matter: exploiting the omission of irrelevant dataArtificial Intelligence, 1997
- Logical settings for concept-learningArtificial Intelligence, 1997
- Decomposability of partially defined Boolean functionsDiscrete Applied Mathematics, 1995
- The complexity and approximability of finding maximum feasible subsystems of linear relationsTheoretical Computer Science, 1995
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993
- Structure identification in relational dataArtificial Intelligence, 1992
- Computational limitations on learning from examplesJournal of the ACM, 1988
- 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
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979