More Fragments of Language

  title={More Fragments of Language},
  author={Ian Pratt-Hartmann and Allan Third},
  journal={Notre Dame J. Formal Log.},
By a fragment of a natural language, we understand a collection of sentences forming a naturally delineated subset of that language and equipped with a semantics commanding the general assent of its native speakers. By the semantic complexity of such a fragment, we understand the computational complexity of deciding whether any given set of sentences in that fragment represents a logically possible situation. In earlier papers by the first author, the semantic complexity of various fragments of… Expand
The Expressive Power of Restricted Fragments of English
This work defines four simple fragments of English based on the syntactic constructions they contain, and describes the circumstances under which an arbitrary first-order formula can be translated back into an English sentence of each fragment. Expand
Querying the Fragments of English
This paper studies the semantic data complexity of a distinguished family of context-free controlled fragments, viz., Pratt and Third's fragments of English, pinpointing those fragments for which the reasoning problems are tractable (in PTIME) or intractable (NP-hard or CONP-hard). Expand
Studying the Distribution of Fragments of English Using Deep Semantic Annotation
We present a preliminary study on how to use deep semantic annotation, namely the Boxer statistical semantic parser, that is capable of producing FO semantic representations for English sentences, toExpand
Completeness Theorems for Syllogistic Fragments
Traditional syllogisms involve sentences of the following simple forms: All X are Y , Some X are Y , No X are Y ; similar sentences with proper names as subjects, and identities between names. TheseExpand
The Data Complexity of the Syllogistic Fragments of English
It is shown how difficult, in terms of semantic (computational) complexity and data complexity (i.r.t. the number of instances declared in a knowledge base), such reasoning problems are. Expand
Attempto Controlled English for Knowledge Representation
Attempto Controlled English (ACE) is a controlled natural language, i.e. a precisely defined subset of English that can automatically and unambiguously be translated into first-order logic. ACE mayExpand
Controlled Natural Language
  • Lnai Founding
  • Computer Science
  • Lecture Notes in Computer Science
  • 2010
A methodology for representation of ontologies in a strictly typed language with dependent types is developed and an experiment where SUMO was translated to GF (Grammatical Framework), a type-theoretical grammar formalism mainly used for natural language applications. Expand
Natural Logic and Semantics
  • L. Moss
  • Mathematics, Computer Science
  • Amsterdam Colloquium on Logic, Language and Meaning
  • 2009
This paper returns to the topic of language and logic, presenting to semanticists natural logic, the study of logics for reasoning with sentences close to their surface form, and presents a fairly new result based on the transitivity of comparative adjective phrases that suggests that in addition to 'meaning postulates' in semantics, the authors will also need to posit 'proof principles'. Expand
A Survey and Classification of Controlled Natural Languages
The goal of this article is to provide a common terminology and a common model for CNL, to contribute to the understanding of their general nature, to create a starting point for researchers interested in the area, and to help developers to make design decisions. Expand
Controlled English for DL-Lite
As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness. On the other hand, querying,Expand


Fragments of Language
This paper represents a casestudy in how to approach the problem of determining the logicalcomplexity of various natural language constructions, and draws some general conclusions about the relationship between naturallanguage and formal logic. Expand
A Two-Variable Fragment of English
This paper defines a controlled language, E2V, whose principalgrammatical resources include determiners, relative clauses, reflexives and pronouns, and provides a formal syntax and semantics for E1V, in whichanaphoric ambiguities are resolved in a linguistically natural way. Expand
Order-Based Inference in Natural Logic
A version of Natural Logic is developed – an inference system that works directly on natural language syntactic representations, with no intermediate translation to logical formulae, and is extended for conjunctive phenomena like coordination and relative clauses. Expand
Natural Language Syntax and First-Order Inference
This paper shows how a fragment of English syntax under Montague semantics provides the foundation of a new inference procedure that seems more effective than corresponding procedures based on either classical syntax or the previously proposed taxonomic syntax. Expand
A Logic for Natural Language
  • W. C. Purdy
  • Computer Science, Mathematics
  • Notre Dame J. Formal Log.
  • 1991
A language called LN whose structure mirrors tilat of natural language, characterized by absence of variables and individual constants, is described, and each step of a proof in [,N has a direct counterpart in the surface language. Expand
A Variable Free Logic for Mass Terms
  • W. C. Purdy
  • Mathematics, Computer Science
  • Notre Dame J. Formal Log.
  • 1992
This paper presents a logic appropriate for mass terms, that is, a logic that does not presuppose interpretation in discrete models, and is similar to surface English, in that the formal language and English are well-translatable, making it particularly suitable for natural language applications. Expand
Natural deduction rules for English
A system of natural deduction rules is proposed for an idealized form of English. The rules presuppose a sharp distinction between proper names and such expressions as ‘the c’, ‘a (an) c’, ‘some c’,Expand
Fluted Formulas and the Limits of Decidability
  • W. C. Purdy
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1996
It was shown that if a fluted formula contains only homogeneous conjunction (conjoins only subformulas of equal arity), then the satisfiability of the formula is decidable, and it remained an open question whether the Satisfiability of a fluting formula without this restriction is dec formidable. Expand
Modal Languages and Bounded Fragments of Predicate Logic
Les nouvelles directions que peuvent prendre les theoremes de Tarski dans un environnement mathematique are indique celle des contraintes structurelles speciales, des extensions infinies, de the logique modale etendue and d'une semantique dynamique. Expand
On languages with two variables
  • M. Mortimer
  • Mathematics, Computer Science
  • Math. Log. Q.
  • 1975