A survey of computational semantics: Representation, inference and knowledge in wide‐coverage text understanding
J Bos - Language and Linguistics Compass, 2011 - Wiley Online Library
The aim of computational semantics is to capture the meaning of natural language
expressions in representations suitable for performing inferences, in the service of …
expressions in representations suitable for performing inferences, in the service of …
An application of automated reasoning in natural language question answering
The LogAnswer system is an application of automated reasoning to the field of open domain
question answering. In order to find answers to natural language questions regarding …
question answering. In order to find answers to natural language questions regarding …
[PDF][PDF] An update on PENG light
C White, R Schwitter - Proceedings of the Australasian Language …, 2009 - aclanthology.org
This paper presents an update on PENG Light, a lightweight and portable controlled natural
language processor that can be used to translate a well-defined subset of English …
language processor that can be used to translate a well-defined subset of English …
System description: E-kRHyper
B Pelzer, C Wernhard - … –CADE-21: 21st International Conference on …, 2007 - Springer
The E-KRHyper system is a model generator and theorem prover for first-order logic with
equality. It implements the new E-hyper tableau calculus, which integrates a superposition …
equality. It implements the new E-hyper tableau calculus, which integrates a superposition …
A novel architecture for situation awareness systems
Situation Awareness (SA) is the problem of comprehending elements of an environment
within a volume of time and space. It is a crucial factor in decision-making in dynamic …
within a volume of time and space. It is a crucial factor in decision-making in dynamic …
[PDF][PDF] SCL (EQ): SCL for first-order logic with equality
H Leidinger, C Weidenbach - International Joint Conference on …, 2022 - library.oapen.org
We propose a new calculus SCL (EQ) for first-order logic with equality that only learns non-
redundant clauses. Following the idea of CDCL (Conflict Driven Clause Learning) and SCL …
redundant clauses. Following the idea of CDCL (Conflict Driven Clause Learning) and SCL …
Automated reasoning in deontic logic
Deontic logic is a very well researched branch of mathematical logic and philosophy.
Various kinds of deontic logics are discussed for different application domains like …
Various kinds of deontic logics are discussed for different application domains like …
Deontic logic for human reasoning
Deontic logic is shown to be applicable for modelling human reasoning. For this the Wason
selection task and the suppression task are discussed in detail. Different versions of …
selection task and the suppression task are discussed in detail. Different versions of …
System description: E-KRHyper 1.4: extensions for unique names and description logic
Formal ontologies may go beyond first-order logic (FOL) in their expressivity, hindering the
usage of common automated theorem provers (ATP) for ontology reasoning. The Unique …
usage of common automated theorem provers (ATP) for ontology reasoning. The Unique …
[PDF][PDF] Méthodes de formalisation des connaissances et des raisonnements mathématiques: aspects appliqués et théoriques
A Paskevych - 2007 - tertium.org
Introduction h—ns l—thèseD nous étudions les moyens de présent—tion des™ onn—iss—
n™ es m—thém—tiques—insi que les s™ hém—s du r—isonnement m—thém—tiqueF xotre …
n™ es m—thém—tiques—insi que les s™ hém—s du r—isonnement m—thém—tiqueF xotre …