Skip to search formSkip to main contentSkip to account menu

Vivifying Propositional Clausal Formulae

A new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF) is presented, empirically compared to the best existing one in terms of size reduction and the ability to improve a state-of-the-art satisfiability solver.
Publisher (opens in a new tab)

XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

The objective of XCSP3 is to ease the effort required to test and compare different algorithms by providing a common test-bed of combinatorial constrained instances by providing almost all constraints that can be found in major constraint solvers developed by the CP community.
arXiv (opens in a new tab)

Extracting MUSes

A new heuristic-based approach to approximate or compute MUSes is presented and it is shown that it often outperforms current competing ones.

Local-search Extraction of MUSes

A new hybrid technique based on local search is introduced in order to approximate and extract minimally unsatisfiable subformulas (in short, MUSes) of unsatisfiable SAT instances, based on an original counting heuristic grafted to a local search algorithm, which explores the neighborhood of the current interpretation in an original manner, making use of a critical clause concept.
Springer Nature (opens in a new tab)

Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle

Experimental studies show that this new approach outperforms the best current existing exhaustive ones and makes use of the powerful concept of critical clause and of a computationally inexpensive local search oracle to boost an exhaustive algorithm proposed by Liffiton and Sakallah.
View Paper (opens in a new tab)

On Approaches to Explaining Infeasibility of Sets of Boolean Clauses

This paper focuses on the concept of minimally unsatisfiable subformulas (MUSes), which explain logical inconsistency in terms of minimal sets of contradictory clauses, and various recent results and computational approaches about MUSes and related concepts are discussed.
IEEE (opens in a new tab)

Let the Solver Deal with Redundancy

A self-adaptative process is proposed to manage redundant clauses, enabling redundant information to be discriminated and to keep only the one that proves useful during the search.
IEEE (opens in a new tab)

Dolius: A Distributed Parallel SAT Solving Framework

This paper proposes a tool called Dolius, mainly based on the divide and conquer paradigm, which does not need shared memory, can be distributed, and scales well when a large number of computing units is available.
Publisher (opens in a new tab)

MUST: Provide a Finer-Grained Explanation of Unsatisfiability

A new form of explanation and recovery technique for the unsatisfiability of discrete CSPs that allows the user to reason both at the constraints andTuples levels by exhibiting both problematic constraints and tuples of values that would allow satisfiability to be recovered if they were not forbidden.
Publisher (opens in a new tab)

Deterministic Parallel DPLL

Experimental results clearly show that the proposed Deterministic Parallel DPLL engine preserves the performance of the parallel portfolio approach while ensuring full reproducibility of the results.
SAGE (opens in a new tab)
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)