MCP: capturing big data by satisfiability (tool description)
From MaRDI portal
Publication:2118299
DOI10.1007/978-3-030-80223-3_14OpenAlexW3186567454MaRDI QIDQ2118299FDOQ2118299
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
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
- Title not available (Why is that?)
- Learning conjunctions of Horn clauses
- Title not available (Why is that?)
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- Logical analysis of data: classification with justification
- Mechanizing hypothesis formation. Mathematical foundations for a general theory
- The GUHA method and its meaning for data mining
- Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
- An efficient algorithm for Horn description
Uses Software
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)