Hybrid ASP-based Approach to Pattern Mining
From MaRDI portal
Publication:4957187
DOI10.1017/S1471068418000467zbMath1472.68152arXiv1808.07302OpenAlexW2952927308WikidataQ128554243 ScholiaQ128554243MaRDI QIDQ4957187
Daria Stepanova, Sergey Paramonov, Pauli Miettinen
Publication date: 3 September 2021
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.07302
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Logic programming (68N17)
Uses Software
Cites Work
- WASP
- MiningZinc: a declarative framework for constraint-based mining
- On the positive-negative partial set cover problem
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- Knowledge representation analysis of graph mining
- Design and implementation of aggregate functions in the DLV system
- Answer Set Programming: A Primer
- Combining Nonmonotonic Knowledge Bases with External Sources
- The Complexity of Mining Maximal Frequent Subgraphs
- Data Mining
- Graph isomorphism in quasipolynomial time [extended abstract]
- Mining (Soft-) Skypatterns Using Dynamic CSP
- Conflict-Driven Answer Set Enumeration
- Discovery Science
- AI*IA 2005: Advances in Artificial Intelligence
- The complexity of theorem-proving procedures
- Constraint-Based Sequence Mining Using Constraint Programming
This page was built for publication: Hybrid ASP-based Approach to Pattern Mining