Computational properties of metaquerying problems

DOI10.1145/635499.635501zbMath1365.68195OpenAlexW2076491023MaRDI QIDQ5267427

Fabrizio Angiulli, Giovambattista Ianni, Rachel Ben-Eliyahu-Zohary, Luigi Palopoli

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/635499.635501

zbMATH Keywords

computational complexitydata mining

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Outlier detection using default reasoning ⋮ Restricted default theories: expressive power and outlier detection tasks ⋮ Metamodeling and metaquerying in \texttt{OWL 2 QL} ⋮ Metaqueries: Semantics, complexity, and efficient algorithms

This page was built for publication: Computational properties of metaquerying problems