Papers
Automatic Synthesis of Smart Table Constraints by Abstraction of Table Constraints
Baudouin Le Charlier, Minh Thanh Khong, Christophe Lecoutre et al.
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem
Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima et al.
An Improved Decision-DNNF Compiler
Jean-Marie Lagniez, Pierre Marquis
Learning to Run Heuristics in Tree Search
Elias B. Khalil, Bistra Dilkina, George L. Nemhauser et al.
Cardinality Encodings for Graph Optimization Problems
Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva
A Core-Guided Approach to Learning Optimal Causal Graphs
Antti Hyttinen, Paul Saikko, Matti Järvisalo
Locality in Random SAT Instances
Jesús Giráldez-Cru, Jordi Levy
Finding Robust Solutions to Stable Marriage
Begum Genc, Mohamed Siala, Barry O'Sullivan et al.
Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques with Evaluations in Clustering Aggregation
Yi Fan, Nan Li, Chengqian Li et al.
Personnel Scheduling as Satisfiability Modulo Theories
Christoph Erkinger, Nysret Musliu
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
Pavel Dvořák, Eduard Eiben, Robert Ganian et al.
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas
Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi
Learning-Based Abstractions for Nonlinear Constraint Solving
Sumanth Dathathri, Nikos Arechiga, Sicun Gao et al.
The DNA Word Design Problem: A New Constraint Model and New Results
Michael Codish, Michael Frank, Vitaly Lagoon
On the Kernelization of Global Constraints
Clément Carbonnel, Emmanuel Hebrard
From Decimation to Local Search and Back: A New Approach to MaxSAT
Shaowei Cai, Chuan Luo, Haochen Zhang
Relaxed Exists-Step Plans in Planning as SMT
Miquel Bofill, Joan Espasa, Mateu Villaret
Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems
Miquel Bofill, Jordi Coll, Josep Suy et al.
Scalable Constraint-based Virtual Data Center Allocation
Sam Bayless, Nodir Kodirov, Ivan Beschastnikh et al.
Stochastic Constraint Programming with And-Or Branch-and-Bound
Behrouz Babaki, Tias Guns, Luc de Raedt
Generating Hard Random Boolean Formulas and Disjunctive Logic Programs
Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski
The Mixing of Markov Chains on Linear Extensions in Practice
Topi Talvitie, Teppo Niinimäki, Mikko Koivisto
A Reduction based Method for Coloring Very Large Graphs
Jinkun Lin, Shaowei Cai, Chuan Luo et al.
Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads
Carlos Hernandez, Adi Botea, Jorge A. Baier et al.