Hoos H, Leyton-Brown K, Schaub T, Schneider M.  2012.  Algorithm Configuration for Portfolio-based Parallel SAT-Solving. Workshop on Combining Constraint solving with Mining and Learning (CoCoMiLe).

• Google Scholar
• BibTex

Andrews T, Blockeel H, Bogaerts B, Bruynooghe M, Denecker M, De Pooter S, Macé C, Ramon J.  2012.  Analyzing manuscript traditions using constraint-based data mining. Workshop on Combining Constraint solving with Mining and Learning (CoCoMiLe).

• Google Scholar
• BibTex

Cussens J.  2012.  Bayesian network learning with cutting planes. Computing Research Repository (CoRR). abs/1202.3713

• Google Scholar
• BibTex

Bessiere C, Coletta R, Koriche F, Lallouet A, Lopez M.  2012.  Branch and Learn pour l'acquisition de CSP. JFPC'2012 : 8ièmes Journées Francophones de Programmation par Contraintes. :64-73.

• Google Scholar
• BibTex

 (461.84 KB)

Santos Costa V, Page D, Qazi M, Cussens J.  2012.  CLP(BN): Constraint Logic Programming for Probabilistic Knowledge. Computing Research Repository (CoRR). abs/1212.2519

• Google Scholar
• BibTex

Cussens J.  2012.  Column generation for exact BN learning: Work in progress. Workshop on Combining Constraint solving with Mining and Learning (CoCoMiLe).

• Google Scholar
• BibTex

Métivier J-P, Boizumault P, Crémilleux B, Khiari M, Loudni S.  2012.  Constrained Clustering Using SAT. International Symposium on Intelligent Data Analysis. :207-218.

• Google Scholar
• BibTex

Sacca C, Frandina S, Diligenti M, Gori M.  2012.  Constrained-based Learning for Text Categorization. Workshop on Combining Constraint solving with Mining and Learning (CoCoMiLe).

• Google Scholar
• BibTex

Métivier J-P, Boizumault P, Crémilleux B, Khiari M, Loudni S.  2012.  A constraint language for declarative pattern discovery. Symposium on Applied Computing (SAC). :119-125.

• Google Scholar
• BibTex

Ruggieri S.  2012.  Deciding membership in a class of polyhedra.. European Conference on Artificial Intelligence.

• Google Scholar
• BibTex

Guns T.  2012.  Declarative Pattern Mining using Constraint Programming. :220.

• Google Scholar
• BibTex

 (3.85 MB)

Coscia M, Rossetti G, Giannotti F, Pedreschi D.  2012.  DEMON: a local-first discovery method for overlapping communities. 18th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD'12). :615-623.

• Google Scholar
• BibTex

 (2.13 MB)

Rinzivillo S, Mainardi S, Pezzoni F, Coscia M, Pedreschi D, Giannotti F.  2012.  Discovering the Geographical Borders of Human Mobility. Künstliche Intelligenz. 26(3):253-260.

• Google Scholar
• BibTex

 (1.16 MB)

Costa F.  2012.  An Efficiently Learnable Constructive Method for Graphs. Workshop on Combining Constraint solving with Mining and Learning (CoCoMiLe).

• Google Scholar
• BibTex

Maudet N, Pini M S, Venable K B, Rossi F.  2012.  Influence and Aggregation of Preferences over Combinatorial Domains. Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS). 3:1313–1314.

• Google Scholar
• BibTex

Wang X, Qian B, Davidson I.  2012.  Labels vs. Pairwise Constraints: A Unified View of Label Propagation and Constrained Spectral Clustering. International Conference on Data Mining (ICDM). :1146–1151.

• Google Scholar
• BibTex

Papini T, Diligenti M.  2012.  Learning-to-rank with Prior Knowledge as Global Constraints. Workshop on Combining Constraint solving with Mining and Learning (CoCoMiLe).

• Google Scholar
• BibTex

Viappiani P.  2012.  A MILP Formulation for Setwise Max-Margin Learning. Workshop on Combining Constraint solving with Mining and Learning (CoCoMiLe).

• Google Scholar
• BibTex

Le Van T, Fierro ACarolina, Guns T, van Leeuwen M, Nijssen S, De Raedt L, Marchal K.  2012.  Mining Local Staircase Patterns in Noisy Data. International Conference on Data Mining Workshops.

• Google Scholar
• BibTex

 (1.72 MB)

Beldiceanu N, Simonis H.  2012.  A Model Seeker: Extracting Global Constraint Models From Positive Examples. 18th International Conference on Principles and Practice of Constraint Programming (CP'12). LNCS 7514:141-157.

• Google Scholar
• BibTex

 (240.09 KB)

Malitsky Y, Sabharwal A, Samulowitz H, Sellmann M.  2012.  Parallel SAT Solver Selection and Scheduling. Principles and Practice of Constraint Programming.

• Google Scholar
• BibTex

 (344.8 KB)

Hoos H.  2012.  Programming by Optimization. Communications of the ACM. 55:70–80.

• Google Scholar
• BibTex

Coquery E, Jabbour S, Sais L, Salhi Y.  2012.  A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence.. European Conference on Artificial Intelligence (ECAI). :258–263.

• Google Scholar
• BibTex

Ugarte W, Boizumault P, Loudni S, Crémilleux B.  2012.  Soft Threshold Constraints for Pattern Mining. Discovery Science. :313-327.

• Google Scholar
• BibTex

Chang M-W, Ratinov L, Roth D.  2012.  Structured learning with constrained conditional models. Machine learning. 88:399–431.

• Google Scholar
• BibTex