Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy clause generation finite domain propagators are considered as clause generators that create a SAT description of their behaviour for a SAT solver. The ability of the SAT solver to explain and record failure and perform conflict di...

Input Distance ( ) is introduced as a metric for propositional resolution derivations. If F = Ci is a formula and D is a clause, then (D;F) is de ned as minijD Cij. The for a derivation is the maximum of any clause in the derivation. Input Distance provides a re nement of the clause-width metric analyzed by Ben-Sasson and Wigderson (JACM 2001) in that it applies to families whose clause width g...

The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does not perform either equivalent-literal detection or binary-clause detection. We describe a generalization of the technique that handles the tracking necessary to support equivalent-literal detection and binary-clause det...

ILP systems which use some form of Inverse Entailment (IE) are based on clause refinement through a hypotheses space bounded by a most specific clause. In this paper we give a new analysis of refinement operators in this setting. In particular, Progol’s refinement operator is revisited and discussed. It is known that Progol’s refinement operator is incomplete with respect to the general subsump...

consisting of a conjunction of clauses, where a clause is a disjunction of literals; a literal is either a variable v (a positive literal) or the negation of a variable ¬v (a negative literal). We are to decide if there is an assignment to the variables satisfying the formula, that is, an assignment under which every clause contains at least one true literal. The example formula is satisfied by...

Existing proposals for implementing the run-time suspension test for GHC concentrate upon suspending unifications in the bodies of clauses being used to evaluate guard literals. However, by making simple alterations to the guard and adding special primitives to it to localise the requirement to suspend to a primitive in the guard, unifications in the bodies of clauses may proceed without being ...

consisting of a conjunction of clauses, where a clause is a disjunction of literals; a literal is either a variable v (a positive literal) or the negation of a variable ¬v (a negative literal). We are to decide if there is an assignment to the variables satisfying the formula, that is, an assignment under which every clause contains at least one true literal. The example formula is satisfied by...

We demonstrate that statistical machine translation (SMT) can be improved substantially by imposing clause-based reordering constraints during decoding. Our analysis of clause-wise translation of different types of clauses shows that it is beneficial to apply these constraints for finite clauses, but not for non-finite clauses. In our experiments in English-Hindi translation with an SMT system ...

Most successful systematic SAT-solvers are descendants of the DPLL procedure and so operate on partial assignments. Using partial assignments is explained by the “enumerative semantics” of the DPLL procedure. Current clause learning SAT-solvers, in a sense, have outgrown this semantics. Instead of enumerating the search space as the DPLL procedure does, they explicitly build a resolution proof....

e) after 350ms wait you should produce back-channel feedback. Our model for English is the same except for some parameters: pitch level (clause a) 26th-percentile, recovery time (clause d) 800ms, and delay (clause e) 700ms. 1 I n t r o d u c t i o n Back-channel feedback, also called "listener responses'~ is, to a first approximation, those responses produced by one participant which do not int...