Papers
Nonlinear Hybrid Planning with Deep Net Learned Transition Models and Mixed-Integer Linear Programming
Buser Say, Ga Wu, Yu Qing Zhou et al.
Temporal Planning with Clock-Based SMT Encodings
Jussi Rintanen
On Neighborhood Singleton Consistencies
Anastasia Paparrizou, Kostas Stergiou
Constraint Games revisited
Anthony Palmieri, Arnaud Lallouet
Efficient Weighted Model Integration via SMT-Based Predicate Abstraction
Paolo Morettin, Andrea Passerini, Roberto Sebastiani
A Partitioning Algorithm for Maximum Common Subgraph Problems
Ciaran McCreesh, Patrick Prosser, James Trimble
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers
Mao Luo, Chu-Min Li, Fan Xiao et al.
Enhancing Campaign Design in Crowdfunding: A Product Supply Optimization Perspective
Qi Liu, Guifeng Wang, Hongke Zhao et al.
Solving Stochastic Boolean Satisfiability under Random-Exist Quantification
Nian-Ze Lee, Yen-Shi Wang, Jie-Hong R. Jiang
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