Mining Top-k motifs with a SAT-based framework

Artificial Intelligence 244 (C):30-47 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

SAT-based MaxSAT algorithms.Carlos Ansótegui, Maria Luisa Bonet & Jordi Levy - 2013 - Artificial Intelligence 196 (C):77-105.
Processes and continuous change in a SAT-based planner.Ji-Ae Shin & Ernest Davis - 2005 - Artificial Intelligence 166 (1-2):194-253.
New width parameters for SAT and #SAT.Robert Ganian & Stefan Szeider - 2021 - Artificial Intelligence 295 (C):103460.
Mining competent case bases for case-based reasoning.Rong Pan, Qiang Yang & Sinno Jialin Pan - 2007 - Artificial Intelligence 171 (16-17):1039-1068.
Resolution for Max-SAT.María Luisa Bonet, Jordi Levy & Felip Manyà - 2007 - Artificial Intelligence 171 (8-9):606-618.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,645,111)

6 months
2 (#1,446,987)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Preferences in AI: An overview.Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci & Henri Prade - 2011 - Artificial Intelligence 175 (7-8):1037-1052.
Itemset mining: A constraint programming perspective.Tias Guns, Siegfried Nijssen & Luc De Raedt - 2011 - Artificial Intelligence 175 (12-13):1951-1983.

Add more references