Reasoning over Semantic Networks – A Typology of Axioms for Natural Language Inference
نویسندگان
چکیده
There are problems related to question answering which obviously call for semantically based logical inferences. For example, a question-answering system should produce the same answer if asked with logically equivalent paraphrases of a question. Moreover, an answer should not only be found for direct matches of the query with the knowledge base but also if the answer is entailed by the latter. A meaning representation of NL texts and logical axioms defined on this representation must account for these aspects. Starting with logical properties of axioms, we define a typology based on five main characteristics which affect the validity and efficiency of natural language inference.
منابع مشابه
Towards a Logical Foundation of Semantic Networks - A Typology of Descriptive Means for Semantic Inference
Semantic Networks (SN) are a knowledge representation paradigm especially suited for the meaning representation of natural language expressions. In order to clearly define their basic constructs, the relations and functions used in a semantic network must be given a logical characterization. The paper exemplifies this strategy for Multilayered Extended Semantic Networks (the so-called MultiNet ...
متن کاملThe Good, the Bad, and the Difficult Complexity in a Monotonicity-Grounded Natural Logic for Reasoning with Generalized Quantifiers
We will present a natural logic (NQL) for reasoning with generalized quantifiers that aims to predict mean human success on syllogistic and related reasoning tasks. Natural logics provide inference rules that operate directly on natural language representations, thereby gaining flexibility and expressive power. NQL thereby proves to be more cognitively plausible than competing theories. We will...
متن کاملEfficient Query Answering over Fuzzy EL-OWL Based on Crisp Datalog Rewritable Fuzzy EL++
OWL EL is an extension of the tractable EL description logic. Despite their inference capabilities over TBoxes, DL reasoners have a high ABox reasoning complexity which may constitute a serious limitation in the Semantic Web where we rely mainly on query answering (i.e. instance checking). The subsomption algorithm used in fuzzy EL reduce instance checking into concept satisfiability. To allow ...
متن کاملCS 10701: Final project report. Textual entailment in the domain of physics
Bag-of-words methods to the problems of semantic text classification and textual entailment have seen some successful applications [3], their straightforward applications are known to break when the training data is sparse, the number of classes is large, or classes do not have clear syntactic boundaries (for example when negational, conditional sentence markers significantly affect classificat...
متن کاملAn Ontology for Collaborative Tasks in Multi-agent Systems
This paper proposes an ontology for task representation and inference. The ontology was developed to support reasoning about tasks, such as task recognition and relocation. Our proposal is formalized in OWL (Web Ontology Language) and SWRL (Semantic Web Rule Language). We show one scenario to exemplify reasoning situations based on the axioms and rules of our ontology. This knowledge-level repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006