Knowledge representation analysis of graph mining
DOI10.1007/s10472-019-09624-yzbMath1485.68248arXiv1608.08956OpenAlexW2964055783WikidataQ114827278 ScholiaQ114827278MaRDI QIDQ2317967
Matthias van der Hallen, Gerda Janssens, Marc Denecker, Sergey Paramonov
Publication date: 13 August 2019
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.08956
knowledge representationhigher orderanswer-set programminggraph miningimperative declarative programming
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Logic programming (68N17)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Itemset mining: a constraint programming perspective
- Dependency learning for QBF
- Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining
- Conflict-driven answer set solving: from theory to practice
- Knowledge representation analysis of graph mining
- Blending lazy-grounding and CDNL search for answer-set solving
- Solution Enumeration for Projected Boolean Search Problems
- Answer Set Programming: A Primer
- HiLog: A foundation for higher-order logic programming
- The B-Book
- Inductive Logic Programming: Theory and methods
- Semantics of templates in a compositional framework for building logics
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
- A model building framework for answer set programming with external computations
- Stable-unstable semantics: Beyond NP with normal logic programs
- Lazy Model Expansion: Interleaving Grounding with Search
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
- Graph isomorphism in quasipolynomial time [extended abstract]
This page was built for publication: Knowledge representation analysis of graph mining
