The syntax and semantic analyses of natural language are described from the standpoint of manmachine communication. The knowledge based system KAUS(Knowledge Acquisition and Utilization System) which has capabilities of deductive inference and automatic program generation of database access is utilized for that purpose. We try to perform syntax and semantic analyses of English sentences more or...

This paper present a new readability formula for French as a foreign language (FFL), which relies on 46 textual features representative of the lexical, syntactic, and semantic levels as well as some of the specificities of the FFL context. We report comparisons between several techniques for feature selection and various learning algorithms. Our best model, based on support vector machines (SVM...

In this paper we describe how a combination of the classical “universal” E-unification and “rigid”E-unification, called “mixed” E-unification, can be used to efficiently handle equality in universal formula semantic tableaux, that are an extension of free variable tableaux.

We argue that model generation programs, i.e., deduction systems that automatically compute the interpretations satisfying a given formula , can provide a procedural interpretation for semantic theories of natural language. We illustrate this claim by describing how the higher-order model generator Kimba interprets deenite descriptions.

The paper provides a survey of semantic methods for solution of fundamental tasks in mathematical knowledge management. Ontological models and formalisms are discussed. We propose an ontology of mathematical knowledge, covering a wide range of fields of mathematics. We demonstrate applications of this representation in mathematical formula search, and learning.

We present a general two-step algorithm which transforms a graph expressing the semantic dependencies between the words of an utterance into logic formulae representing the different semantic interpretations of the utterance. The algorithm focuses on the scopal elements of the utterance, i.e. quantifiers and scopal predicates. First, the scope of every scopal element is computed as a subgraph o...

This paper presents a semi-formal denotational definition of the semantics of a version of domain relational calculus called DRC. A single basic design principle governs the semantic definition: each predicate (or formula) of DRC denotes a relation. The definition obtained is precise, short, and systematic. Generalizations of operations of the relational algebra are suggested, which correspond ...

This paper proposes a particular kind of logics as a formal framework for the non-formal sciences. Such logics of objects turn out to be quite different from recent mathematical logic, but they can be seen as updated versions of the classic conception of logic that is due to Frege, Russell, and the early Carnap. Though obsolete, from the point of view of pure mathematics, logics of this kind ma...

This study addresses the problem of improving the quality of natural language (NL) understanding by means of the involvement of the additional criterion of correct formal representation of the input inquiry. This criterion is based on the logical compatibility between the input inquiry, translated into the formal language, and the domain, encoded in the same language. Inquiry generality is meas...

The impossibility of semantically complete deductive calculi for logics for imperative programs has led to the study of two alternative approaches to completeness: “local” semantic completeness on the one hand (Cook’s relative completeness, Harel’s Arithmetical completeness), and completeness with respect to other forms of reasoning about programs, on the other. However, local semantic complete...