MCP: capturing big data by satisfiability (tool description)

DOI10.1007/978-3-030-80223-3_14OpenAlexW3186567454MaRDI QIDQ2118299

Gernot Salzer, Miki Hermann

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_14

zbMATH Keywords

machine learningdata classificationinformation extractionexplainable AIbit vectors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• JBool
• MPI

Cites Work

• Unnamed Item
• Unnamed Item
• Logical analysis of data: classification with justification
• An efficient algorithm for Horn description
• The GUHA method and its meaning for data mining
• Learning conjunctions of Horn clauses
• Polynomial interpolation and the Chinese remainder theorem for algebraic systems
• Mechanizing hypothesis formation. Mathematical foundations for a general theory
• Efficient Algorithms for Description Problems over Finite Totally Ordered Domains

This page was built for publication: MCP: capturing big data by satisfiability (tool description)