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...

Clause learning is a technique used by backtracking-based propositional satisfiability solvers, where some clauses obtained by analysis of conflicts are added to the formula during backtracking. It has been observed empirically that clause learning does not significantly improve the performance of a solver when restricted to learning clauses of small width only. This experience is supported 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 ...

The paper presents a new resource light flexible method for clause alignment which combines the Gale-Church algorithm with internally collected textual information. The method does not resort to any pre-developed linguistic resources which makes it very appropriate for resource light clause alignment. We experiment with a combination of the method with the original Gale-Church algorithm (1993) ...

This paper proposes and discusses issues on local and global text structures, all of them being connected to a lexical concept of predication. The main contributions of the present work comprise: (a) A novel functional X-bar (FX-bar) scheme is advised, aiming to reveal, model and relate the local, clause-level markers and text structures. (b) At global level, two FX-bar schemes are proposed, on...