In this paper, we describe our experiments with clause segmentation in producing summaries for the TAC 2008 Update Summarization Track. The submitted runs were designed to determine if a heuristic clause segmentation applied before sentence selection would improve summarization results by reducing the need for sentence compression approaches. A baseline summariser was used to test this hypothes...

Purdom proposed \complement search" as a method to introduce additional constraints into a satis ability search, without changing whether the formula is satis able, with the hope of reducing the amount of search. Kullmann proposed \blocked-clause introduction", which is closely related to \complement search", with the same aim. This paper generalizes the concept of \blocked clause" to \nondecis...

This study aims to present an accessible model of some frequent nonfinite adverbial types occurring in English prose fiction. As its main syntactic argument, it recognizes that these adverbials are mostly elliptical in that there are some dependent-clause markers one can assume to be implicit when supplying those elements back into the clause complex. Some comments are provided at the end on th...

Let F = Qlxr Qzxz l ** Qnx, C be a quantified Boolean formula with no free variables, where each Qi is either 3 or t, and C is in conjunctive normal form. That is, C is a conjunction of clauses, each clause is a disjunction of literals, and each literal is either a variable, xi, or the negation of a variable, Zi (1 < i f n). We shall use Ui to denote a literal equal to either Xi or Fi. The eval...

Let us look at a special type of context sensitive grammars, the so-called Definite Clause Grammars, or DCG, as described by Pereira and Warren (l980). The following question seems natural here: every context sensitive language be described by meeins of a definite clause grammar ? The question must be answered in the eiffirmative, as can be seen by simu­ lating Turing machines or better Markov ...

Proof reconstruction is the operation of extracting the computed proof from the trace of a theorem proving run. In experiments with distributed theorem proving by ClauseDiffusion, we observed that proof reconstruction is far from being a trivial task in distributed theorem proving with contraction: because of the distributed nature of the derivation and especially because of backward contractio...

An unsatisfiability proof is a series of applications of proof rules on an input formula to deduce false. Unsatisfiability proofs for a Boolean formula can find many applications in verification. For instance, one application is automatic learning of abstractions for unbounded model checking by analyzing proofs of program safety for bounded steps [6, 5, 4]. We can also learn unsatisfiable cores...

Previous research suggests that time-based working memory limits of 2e3 s constrain the integration of verbal information, and that speakers tend to parse sentences into prosodic phrases that do not extend beyond this time window. The present study used Event-Related Potentials (ERPs) to investigate how time-driven implicit prosodic phrasing influences the syntactic processing of embedded claus...