Symbiosis of Search and Heuristics for Random 3-SAT
Evaluating approaches for solving Satisfiability problems with Preferences
Partitioning SAT Instances for Distributed Solving
Modular Construction of Ground Logic Programs using LPCAT
Grounding Formulas with Complex Terms
Built-in Arithmetic in Knowledge Representation Languages
Dependency Management for the Eclipse Ecosystem: An Update
Grounding FO(ID) with Bounds
DPLL(Agg): an efficient SMT module for aggregates.