This paper describes a working prototype that determines possible relative quantifier scopes and pronoun bindings for natural language sentences, with coverage of a variety of problematic cases. The prototype parses a significant fragment of English, positing empty categories and deriving various relationships among constituents in addition to dominance. It applies cross-linguistically valid principles of Government-Binding theory to compute a set of "Logical Forms" for each sentence it parses, and to derive possible relative quantifier scopes from these Logical Forms. It then translates sentences into an enriched predicate logic. Simple principles apply to these translations to determine possibilities for interpretation of pronouns as bound variables. The prototype's scope and binding modules correspond transparently to elements of a principle-based grammar. Principles apply as filters. All processing is nevertheless highly efficient. The computational techniques employed in the prototype may find wider application in principle-based language processing.

First-order logic uses quantified variables over non-logical objects and allows the use of sentences that contain variables, so that rather than propositions such This glossary of artificial intelligence is a list of definitions of terms and concepts relevant to the study of artificial intelligence (AI), its subdisciplines, and related fields. Related glossaries include Glossary of computer science, Glossary of robotics, Glossary of machine vision, and Glossary of logic. Also first-order predicate calculus or predicate logic. A collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects and allows the use of sentences that contain variables, so that rather than propositions such as Socrates is a man one can have expressions in the form "there exists X such that X is Socrates and X is a man" and there exists is a quantifier while X is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations. predicate logic Also first-order logic, predicate logic, and first-order predicate calculus.A collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects and allows the use of sentences that contain variables, so that rather than propositions such as Socrates is a man one can have expressions in the form "there exists x such that x is Socrates and x is a man" and there exists is a quantifier while x is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic. predictive analytics A variety of statistical techniques from data mining, predictive modelling, and machine learning, that analyze current and historical facts to make predictions about future or otherwise unknown events.

Abstract The vital part of the studies of logic seeks to determine structural criteria for propositional validity and deals with formal inference relations. A suitable starting point for any analysis of these problems consists in the selection of a set of propositions from among all grammatically well-formed sentences, the members of which satisfy some specified syntactical and semantical conditions. The assumption stating that to every proposition it may be ascribed exactly one of the two logical values, truth or falsity, called the principle of bivalence, constitutes the basis of classical logic. It determines both the subject matter and the scope of applicability of the logic, the main systems of which are the classical propositional calculus (CPC) and the (first-order) predicate calculus (quantifier calculus). CPC is a theory of all truth-functional propositional connectives, i.e. sentence-argument propositional functions having the property that the logical value of any complex sentence formed with their use is determined uniquely by the logical values of its components. The predicate calculus is formed by introducing to the language system, with its semantics adequately extended, the symbols of name-argument propositional functions representing the names of properties and relations and name quantifiers. It renders possible the profound analysis of propositions within the principle of bivalence paradigm.