Flattening is a method to make a de nite clause function-free. For a de nite clause C, attening replaces every occurrence of a term f(t 1 ; ; t n ) in C with a new variable v and adds an atom p f (t 1 ; ; t n ; v) with the associated predicate symbol p f with f to the body of C. Here, we denote the resulting function-free de nite clause from C by at(C). In this paper, we discuss the relationshi...

A clause is a disjunction of literals. We use set notation; a set of literals denotes the clause that is their disjunction. The empty clause is denoted by . The width of a clause C, denoted |C|, is the number of literals in it. The width of a CNF formula F , denoted width(F ), is the maximum width of any clause in F . For a partial assignment ρ, C|ρ denotes the restriction of the clause C by ap...

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

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

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

One of the most challenging aspects of the analysis of resultative constructions in English is the appearance in some cases of what we might call a \nonthematic object," an object that is not a semantic argument of the verb of the clause. This aspect challenges the claim that the grammatical functions of a clause are determined by the lexical properties of the verb of the clause. We need to aba...

Abstract This study analyses the role of conjunctions in clause linkage Australian languages. Conjunctions are seemingly straightforward clause-linking devices, but they remain under-studied, both for languages and from a broader typological perspective. In this study, we propose functional definition conjunctions, as set against other resources linkage. We show that captures not just prototypi...

Connections between Muggleton's stochastic logic programs (SLPs) and (undirected) Bayesian nets are explored. Logical variables map to random variables, predicates map to joint distributions and Markov net structure maps to clausal structure. Naive methods for answering proba-bilistic queries using SLPs are given, as well as some suggestions for non-naive approaches. Multi-clause SLPs deene mix...

The paper describes a rule-based system for tagging clause boundaries, implemented for annotating the Estonian Reference Corpus of the University of Tartu, a collection of written texts containing ca 245 million running words and available for querying via Keeleveeb language portal. The system needs information about parts of speech and grammatical categories coded in the word-forms, i.e. it ta...