{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:45Z","timestamp":1740123885677,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T00:00:00Z","timestamp":1553731200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"crossref","award":["1S54518N"],"award-info":[{"award-number":["1S54518N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10472-019-09624-y","type":"journal-article","created":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T06:02:31Z","timestamp":1553752951000},"page":"21-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Knowledge representation analysis of graph mining"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1893-9369","authenticated-orcid":false,"given":"Matthias","family":"van der Hallen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Paramonov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerda","family":"Janssens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,28]]},"reference":[{"key":"9624_CR1","unstructured":"Abramson, H., Rogers, H.: Meta-Programming in Logic Programming. MIT Press (1989)"},{"key":"9624_CR2","doi-asserted-by":"publisher","unstructured":"Abrial, J.R.: The B-Book. Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9780511624162 (1996)","DOI":"10.1017\/CBO9780511624162"},{"key":"9624_CR3","doi-asserted-by":"crossref","unstructured":"Abrial, J.R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139195881"},{"key":"9624_CR4","doi-asserted-by":"publisher","unstructured":"Aoga, J.O.R., Guns, T., Schaus, P.: An efficient algorithm for mining frequent sequence with constraint programming. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2016, Riva del Garda, Italy, September 19-23, 2016, Proceedings, Part II, Lecture Notes in Computer Science, vol. 9852, pp 315\u2013330. Springer (2016), https:\/\/doi.org\/10.1007\/978-3-319-46227-1_20","DOI":"10.1007\/978-3-319-46227-1_20"},{"key":"9624_CR5","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. CoRR 1512.03547 (2015)"},{"key":"9624_CR6","unstructured":"Bogaerts, B., Janhunen, T., Tasharrofi, S.: Solving QBF instances with nested SAT solvers. In: Darwiche, A. (ed.) Beyond NP, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016., AAAI Workshops. http:\/\/www.aaai.org\/ocs\/index.php\/WS\/AAAIW16\/paper\/view\/12603 , vol. WS-16-05. AAAI Press (2016)"},{"key":"9624_CR7","unstructured":"Bowen, J.P.: Formal Specification and Documentation using Z. International Thomson Computer Press (1996)"},{"key":"9624_CR8","doi-asserted-by":"crossref","unstructured":"Brewka, G., Delgrande, J.P., Romero, J., Schaub, T.: asprin: Customizing answer set preferences without a headache. In: AAAI, pp. 1467\u20131474. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9398"},{"issue":"6","key":"9624_CR9","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1017\/S147106841400009X","volume":"15","author":"M Bruynooghe","year":"2015","unstructured":"Bruynooghe, M., Blockeel, H., Bogaerts, B., de Cat, B., Pooter, S.D., Jansen, J., Labarre, A., Ramon, J., Denecker, M., Verwer, S.: Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3. Theory Practice Logic Program. (TPLP) 15(6), 783\u2013817 (2015). https:\/\/doi.org\/10.1017\/S147106841400009X","journal-title":"Theory Practice Logic Program. (TPLP)"},{"key":"9624_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1613\/jair.4591","volume":"52","author":"B Cat de","year":"2015","unstructured":"de Cat, B., Denecker, M., Bruynooghe, M., Stuckey, P.J.: Lazy model expansion: Interleaving grounding with search. J. Artif. Intell. Res. 52, 235\u2013286 (2015). https:\/\/doi.org\/10.1613\/jair.4591","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"9624_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0743-1066(93)90039-J","volume":"15","author":"W Chen","year":"1993","unstructured":"Chen, W., Kifer, M., Warren, D.S.: Hilog: A foundation for higher-order logic programming. J. Logic Program. 15(3), 187\u2013230 (1993)","journal-title":"J. Logic Program."},{"issue":"5-6","key":"9624_CR12","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1017\/S1471068417000254","volume":"17","author":"B Cuteri","year":"2017","unstructured":"Cuteri, B., Dodaro, C., Ricca, F., Schu\u0307ller, P.: Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis. Theory Pract. Logic Program. (TPLP) 17(5-6), 780\u2013799 (2017)","journal-title":"Theory Pract. Logic Program. (TPLP)"},{"issue":"4-5","key":"9624_CR13","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1017\/S1471068415000319","volume":"15","author":"I Dasseville","year":"2015","unstructured":"Dasseville, I., van der Hallen, M., Janssens, G., Denecker, M.: Semantics of templates in a compositional framework for building logics. Theory Pract. Logic Program. (TPLP) 15(4-5), 681\u2013695 (2015). https:\/\/doi.org\/10.1017\/S1471068415000319","journal-title":"Theory Pract. Logic Program. (TPLP)"},{"key":"9624_CR14","unstructured":"De Cat, B., Bogaerts, B., Bruynooghe, M., Janssens, G., Denecker, M.: Predicate logic as a modelling language: The IDP system. CoRR 1401.6312v2 (2016)"},{"key":"9624_CR15","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: ACM SIGKDD, pp. 204\u2013212 (2008)","DOI":"10.1145\/1401890.1401919"},{"issue":"4","key":"9624_CR16","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1017\/S1471068415000113","volume":"16","author":"T Eiter","year":"2016","unstructured":"Eiter, T., Fink, M., Ianni, G., Krennwallner, T., Redl, C., Schu\u0307ller, P.: A model building framework for answer set programming with external computations. Theory Pract. Logic Program. (TPLP) 16(4), 418\u2013464 (2016)","journal-title":"Theory Pract. Logic Program. (TPLP)"},{"key":"9624_CR17","doi-asserted-by":"crossref","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: A primer. In: Reasoning Web, Lecture Notes in Computer Science, vol. 5689, pp. 40\u2013110. Springer (2009)","DOI":"10.1007\/978-3-642-03754-2_2"},{"key":"9624_CR18","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers (2012)","DOI":"10.2200\/S00457ED1V01Y201211AIM019"},{"key":"9624_CR19","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report. CoRR 1405.3694 (2014)"},{"key":"9624_CR20","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected boolean search problems. In: Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR), Lecture Notes in Computer Science, vol. 5547, pp. 71\u201386. Springer (2009)","DOI":"10.1007\/978-3-642-01929-6_7"},{"key":"9624_CR21","first-page":"41","volume-title":"Efficiency Analysis of ASP Encodings for Sequential Pattern Mining Tasks","author":"T Guyet","year":"2018","unstructured":"Guyet, T., Moinard, Y., Quiniou, R., Schaub, T.: Efficiency Analysis of ASP Encodings for Sequential Pattern Mining Tasks, pp 41\u201381. Springer International Publishing, Cham (2018)"},{"key":"9624_CR22","doi-asserted-by":"crossref","unstructured":"van der Hallen, M., Janssens, G.: A grounder from second-order logic to qbf. In: Quantified Boolean Formulas, Papers from the 2018 FLoC Quantified Boolean Formulas and Beyond Workshop, Oxford, England, July 8, 2018 (accepted), Federated Logic Conference (FLoC): workshop proceedings (2018)","DOI":"10.29007\/k3nd"},{"key":"9624_CR23","unstructured":"van der Hallen, M., Paramonov, S., Leuschel, M., Janssens, G.: Knowledge representation analysis of graph mining. CoRR 1608.08956 (2016)"},{"key":"9624_CR24","doi-asserted-by":"publisher","unstructured":"Immerman, N.: Descriptive complexity and model checking. In: Arvind, V., Ramanujam, R. (eds.) Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings, Lecture Notes in Computer Science, vol. 1530, pp 1\u20135. Springer (1998), https:\/\/doi.org\/10.1007\/978-3-540-49382-2_1","DOI":"10.1007\/978-3-540-49382-2_1"},{"key":"9624_CR25","doi-asserted-by":"crossref","unstructured":"J\u00e4rvisalo, M.: Itemset mining as a challenge application for answer set enumeration. Logic Programming and Nonmonotonic Reasoning (LPNMR), 304\u2013310 (2011)","DOI":"10.1007\/978-3-642-20895-9_35"},{"issue":"3","key":"9624_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1609\/aimag.v37i3.2672","volume":"37","author":"B Kaufmann","year":"2016","unstructured":"Kaufmann, B., Leone, N., Perri, S., Schaub, T.: Grounding and solving in answer set programming. AI Mag. 37(3), 25\u201332 (2016). http:\/\/www.aaai.org\/ojs\/index.php\/aimagazine\/article\/view\/2672","journal-title":"AI Mag."},{"issue":"2","key":"9624_CR27","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10601-016-9252-z","volume":"22","author":"A Kemmar","year":"2017","unstructured":"Kemmar, A., Lebbah, Y., Loudni, S., Boizumault, P., Charnois, T.: Prefix-projection global constraint and top-k approach for sequential pattern mining. Constraints 22(2), 265\u2013306 (2017). https:\/\/doi.org\/10.1007\/s10601-016-9252-z","journal-title":"Constraints"},{"key":"9624_CR28","unstructured":"Lamport, L.: Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley (2002)"},{"issue":"2","key":"9624_CR29","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10009-007-0063-9","volume":"10","author":"M Leuschel","year":"2008","unstructured":"Leuschel, M., Butler, M.J.: ProB: An automated analysis toolset for the B method. STTT 10(2), 185\u2013203 (2008)","journal-title":"STTT"},{"issue":"5","key":"9624_CR30","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1021\/ci050135u","volume":"45","author":"H Li","year":"2005","unstructured":"Li, H., Yap, C.W., Ung, C.Y., Xue, Y., Cao, Z.W., Chen, Y.Z.: Effect of selection of molecular descriptors on the prediction of bloodbrain barrier penetrating and nonpenetrating agents by statistical learning methods. J. Chem. Inf. Model. 45(5), 1376\u20131384 (2005). https:\/\/doi.org\/10.1021\/ci050135u . PMID: 16180914","journal-title":"J. Chem. Inf. Model."},{"issue":"2\u20133","key":"9624_CR31","first-page":"71","volume":"7","author":"F Lonsing","year":"2010","unstructured":"Lonsing, F., Biere, A.: Depqbf: A dependency-aware QBF solver. JSAT 7(2\u20133), 71\u201376 (2010). http:\/\/jsat.ewi.tudelft.nl\/content\/volume7\/JSAT7_6_Lonsing.pdf","journal-title":"JSAT"},{"key":"9624_CR32","doi-asserted-by":"publisher","unstructured":"Lonsing, F., Egly, U., Gelder, A.V.: Efficient clause learning for quantified boolean formulas via QBF pseudo unit propagation. In: J\u00e4rvisalo, M., Gelder, A.V. (eds.) Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings, Lecture Notes in Computer Science, vol. 7962, pp 100\u2013115. Springer (2013), https:\/\/doi.org\/10.1007\/978-3-642-39071-5_9","DOI":"10.1007\/978-3-642-39071-5_9"},{"key":"9624_CR33","unstructured":"McCarthy, J.: Elaboration tolerance. In: Working Papers of the Fourth International Symposium on Logical formalizations of Commonsense Reasoning, Commonsense-1998 (1998)"},{"issue":"\/20","key":"9624_CR34","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S., Raedt, L.D.: Inductive logic programming: Theory and methods. J. Log. Program. 19(\/20), 629\u2013679 (1994). https:\/\/doi.org\/10.1016\/0743-1066(94)90035-3","journal-title":"J. Log. Program."},{"key":"9624_CR35","doi-asserted-by":"publisher","unstructured":"Nijssen, S., Kok, J.N.: Frequent graph mining and its application to molecular databases. In: Proceedings of the IEEE International Conference on Systems, Man & Cybernetics: The Hague, Netherlands, 10-13 October 2004, pp. 4571\u20134577. IEEE. https:\/\/doi.org\/10.1109\/ICSMC.2004.1401252 (2004)","DOI":"10.1109\/ICSMC.2004.1401252"},{"key":"9624_CR36","unstructured":"Paramonov, S., Chen, T., Guns, T.: Generic mining of condensed pattern representations under constraints. In: CEUR: Young Scientist\u2018s Second International Workshop on Trends in Information Processing Proceedings (YSIP), vol. 1837, pp. 138\u2013177 (2017)"},{"key":"9624_CR37","doi-asserted-by":"publisher","unstructured":"Peitl, T., Slivovsky, F., Szeider, S.: Dependency learning for QBF. In: Gaspers, S., Walsh, T. (eds.) Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, Lecture Notes in Computer Science, vol. 10491, pp 298\u2013313. Springer (2017), https:\/\/doi.org\/10.1007\/978-3-319-66263-_19","DOI":"10.1007\/978-3-319-66263-_19"},{"key":"9624_CR38","doi-asserted-by":"publisher","unstructured":"R\u00fcckert, U., Kramer, S.: Optimizing feature sets for structured data. In: Kok, J.N., Koronacki, J., de M\u00e1ntaras, R.L., Matwin, S., Mladenic, D., Skowron, A. (eds.) Machine Learning: ECML 2007, 18th European Conference on Machine Learning, Warsaw, Poland, September 17-21, 2007, Proceedings, Lecture Notes in Computer Science, vol. 4701, pp 716\u2013723. Springer (2007), https:\/\/doi.org\/10.1007\/978-3-540-74958-5_72","DOI":"10.1007\/978-3-540-74958-5_72"},{"key":"9624_CR39","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. In: International Conference on Computer-Aided Design (ICCAD), San Jose, California, USA, November 10-14 1996, pp. 220\u2013227 (1996)"},{"issue":"1","key":"9624_CR40","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.drudis.2012.07.016","volume":"18","author":"I Takigawa","year":"2013","unstructured":"Takigawa, I., Mamitsuka, H.: Graph mining: Procedure, application to drug discovery and recent advances. Drug Discov. Today 18(1), 50\u201357 (2013). https:\/\/doi.org\/10.1016\/j.drudis.2012.07.016 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1359644612002759","journal-title":"Drug Discov. Today"},{"key":"9624_CR41","doi-asserted-by":"crossref","unstructured":"Weinzierl, A.: Blending lazy-grounding and CDNL search for answer-set solving. In: Logic Programming and Nonmonotonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 10377, pp. 191\u2013204. Springer (2017)","DOI":"10.1007\/978-3-319-61660-5_17"},{"key":"9624_CR42","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM \u201902, pp 721\u2013. IEEE Computer Society, Washington (2002)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09624-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-019-09624-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09624-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T14:47:49Z","timestamp":1663166869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-019-09624-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,28]]},"references-count":42,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9624"],"URL":"https:\/\/doi.org\/10.1007\/s10472-019-09624-y","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2019,3,28]]},"assertion":[{"value":"28 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}