LogicWeb has traditionally lacked devices for expressing mutually exclusive clauses. We address this limitation by adopting choice-conjunctive clauses of the form D0&D1 where D0,D1 are Horn clauses and & is a linear logic connective. Solving a goal G using D0&D1 – pv(D0&D1, G) – has the following operational semantics: choose a successful one between pv(D0, G) and pv(D1, G). In other words, if ...

This paper is about non-interrogative temporal embedded clauses introduced by when (temporal when-clauses), their semantic interpretation and their syntax/semantics mapping. Our goal is to provide a fully compositional account of temporal when-clauses that accounts for their formal identity with interrogative clauses and their difference in meaning. The main idea is that temporal when-clauses a...

A simple nonconstructive argument shows that most CNF formulas with clauses (where is a large enough constant) are not satisfiable. It is an open question whether there is an efficient refutation algorithm that for most formulas with clauses proves that they are not satisfiable. We present a polynomial time algorithm that for most CNF formulas with clauses (where is a large enough constant) fin...

In Danish relative clauses and embedded interrogative clauses are not extraction islands. However, there is an asymmetry between the two clauses. In Danish it is possible to extract the subject out of an embedded interrogative clause. Extraction of the subject out of a relative clause, on the other hand, is not allowed. In this paper we present a formal HPSG analysis of extraction in Danish whi...

Communicat ion among agents collaborating on a task often involves complex ut terances about multiple actions. In this paper, we analyze two part icular multiaction constructions, ut terances with means clauses and utterances with rationale clauses. We present the distinctive features of these constructions, describe their logical form, and define interpretation rules for deriving their meaning...

Clausal izyooni ‘than’-comparatives in Japanese allow izyooni ‘than’-clauses with their degree positons filled. I consider them a degree version of Internally Headed Relative Clauses (IHRCs). In this preliminary study, I adopt Gross and Landman’s (2012) Choose Role analysis of IHRCs in Japanese and propose a similar functional category Choose Degree, which “re-opens” a degree variable position ...

In SATPLAN [4] a valid plan is encoded as a satisfying assignment of a set of propositional clauses. Unfortunately, the number of clauses is often impractically large. Even using clever, but arguably unnatural, encodings [3] can still give too many clauses. The origin of the size difficulty is simple. Planning encodings are naturally written in terms of universally quantified “lifted” clauses s...