Preference-based Inconsistency Proving: When the Failure of the Best Is Sufficient (original) (raw)

European Conference on Artificial Intelligence, 2006

Abstract

Inconsistency proving of CSPs is typically achieved by a combination of systematic search and arc consistency, which can both be characterized as resolution. However, it is well-known that there are cases where resolution produces exponential contradiction proofs, although proofs of polynomial size exist. For this reason, we will use optimization methods to reduce the proof size globally by 1. decomposing

Ulrich Junker hasn't uploaded this paper.

Let Ulrich know you want this paper to be uploaded.

Ask for this paper to be uploaded.