Minimum multiple characterization of biological data using partially defined boolean formulas

Authors:
Fabien Chhel;Frédéric Lardeux;Adrien Goëffon;Frédéric Saubion
Affiliations:
LERIA University of Angers France;LERIA University of Angers France;LERIA University of Angers France;LERIA University of Angers France
Venue:
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Year:
2012

Citing 11
Cited 0

A theory of the learnable

Communications of the ACM
On learning Boolean functions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Horn Extensions of a Partially Defined Boolean Function

SIAM Journal on Computing
Decision lists and related Boolean functions

Theoretical Computer Science
The minimum equivalent DNF problem and shortest implicants

Journal of Computer and System Sciences
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Learning Logical Definitions from Relations

Machine Learning
Redundancy in Random SAT Formulas

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Exact learning via the Monotone theory

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Eliminating Redundant Clauses in SAT Instances

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An algebraic perspective on Boolean function learning

ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we adress a characterization problem coming from plant biology. We consider different groups of experiments, each corresponding to the indentification of a given bacteria with regards to a given set of characters for diagnosis purposes. We have to compute simultaneously a complete minimal set of characterization formulas for each group. We propose two different approaches, based on Boolean functions, that allow us to study the satisfiability and the underlying complexity of this problem.