An Expressive First-Order Logic with Flexible Typing for Natural Language Semantics

2004 ◽  
Vol 12 (2) ◽  
pp. 135-168 ◽  
Author(s):  
C. Fox
Keyword(s):  
Natural Language ◽  
Order Logic ◽  
First Order Logic ◽  
Natural Language Semantics ◽  
First Order ◽  
Language Semantics

Help Generation in a System for Learning Natural Language to First Order Logic Conversion

2011 ◽  
Author(s):  
Isidoros Perikos ◽  
Foteini Grivokostopoulou ◽  
Ioannis Hatzilygeroudis
Keyword(s):  
Natural Language ◽  
Order Logic ◽  
First Order Logic ◽  
First Order

scholarly journals VIII—Propositions and Cognitive Relations

2019 ◽  
Vol 119 (2) ◽  
pp. 157-178 ◽  
Author(s):  
Nicholas K Jones
Keyword(s):  
Natural Language ◽  
Recent Work ◽  
Natural Language Semantics ◽  
True Nature ◽  
First Order ◽  
Turn On ◽  
Language Semantics ◽  
Ontological Categories ◽  
The Difference ◽  
Semantic Types

Abstract There are two broad approaches to theorizing about ontological categories. Quineans use first-order quantifiers to generalize over entities of each category, whereas type theorists use quantification on variables of different semantic types to generalize over different categories. Does anything of import turn on the difference between these approaches? If so, are there good reasons to go type-theoretic? I argue for positive answers to both questions concerning the category of propositions. I also discuss two prominent arguments for a Quinean conception of propositions, concerning their role in natural language semantics and apparent quantification over propositions within natural language. It will emerge that even if these arguments are sound, there need be no deep question about Quinean propositions’ true nature, contrary to much recent work on the metaphysics of propositions.

Translating Advanced Integrity Checking Technology to SQL

2002 ◽  
pp. 203-249 ◽  
Author(s):  
Hendrik Decker
Keyword(s):  
Natural Language ◽  
Order Logic ◽  
Predicate Calculus ◽  
Integrity Constraints ◽  
First Order Logic ◽  
First Order ◽  
Integrity Checking ◽  
Natural Language Interface ◽  
User Friendly ◽  
Declarative Specifications

The main goal of this chapter is to arrive at a coherent technology for deriving efficient SQL triggers from declarative specifications of arbitrary integrity constraints. The user may specify integrity constraints declaratively as closed queries in predicate calculus syntax (i.e., sentences in the language of first-order logic, abbr. FOL), as datalog denials, as query conditions in SQL WHERE clauses, or in some other, possibly more user-friendly manner (e.g., via a dialog-driven graphical or natural language interface which internally translates to equivalent WHERE clause conditions). As we are going to see, the triggers derived from such specifications behave such that whenever some update event would violate any of the integrity constraints, one or several of the triggers derived from that constraint are activated in order to enforce the constraint. That is, the violation is either prevented by rolling back the update or repaired instantly by subsequent further updates.

Automatic estimation of exercises'difficulty levels in a tutoring system for teaching the conversion of natural language into first-order logic

2016 ◽  
Vol 33 (6) ◽  
pp. 569-580 ◽  
Author(s):  
Isidoros Perikos ◽  
Foteini Grivokostopoulou ◽  
Konstantinos Kovas ◽  
Ioannis Hatzilygeroudis
Keyword(s):  
Natural Language ◽  
Order Logic ◽  
First Order Logic ◽  
Tutoring System ◽  
First Order ◽  
Automatic Estimation

Difficulty Estimator for Converting Natural Language into First Order Logic

2011 ◽  
pp. 135-144 ◽  
Author(s):  
Isidoros Perikos ◽  
Foteini Grivokostopoulou ◽  
Ioannis Hatzilygeroudis ◽  
Konstantinos Kovas
Keyword(s):  
Natural Language ◽  
Order Logic ◽  
First Order Logic ◽  
First Order
Sign in / Sign up

Export Citation Format

Share Document