MCP: capturing big data by satisfiability (tool description)

DOI10.1007/978-3-030-80223-3_14MaRDI QIDQ2118299zbMATH OpenOpenAlexFDO

Authors Miki Hermann, Gernot Salzer

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

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

Cites work

• scientific article; zbMATH DE number 5852793 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An efficient algorithm for Horn description
• Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
• Learning conjunctions of Horn clauses
• Logical analysis of data: classification with justification
• Mechanizing hypothesis formation. Mathematical foundations for a general theory
• Polynomial interpolation and the Chinese remainder theorem for algebraic systems
• The GUHA method and its meaning for data mining

Describes a project that uses

Uses Software

• MPI
• JBool

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118299)