Negation in Cognitive Reasoning
نویسندگان
چکیده
Negation is both an operation in formal logic and natural language by which a proposition replaced one stating the opposite, as addition of "not" or another negation cue. Treating adequate way required for cognitive reasoning, aims at modeling human ability to draw meaningful conclusions despite incomplete inconsistent knowledge. One task reasoning answering questions given sentences language. There are tools based on discourse representation theory convert automatically into representation, additional knowledge can be added using predicate names formula databases. However, databases practice always incomplete. Hence, forward automated systems alone does not suffice derive answers because, instead complete proofs, often only partial positive derived, while negative used during process. In consequence, we aim eliminating syntactic negation, strictly speaking, negated event property. this paper, describe effective procedure determine property order replace it its inverse. This lays basis employing machine learning general question answering. We evaluate our several benchmarks demonstrate practical usefulness system.
منابع مشابه
What About Negation in Spatial Reasoning?
How do we reason about spatial descriptions? In recent years a lot of research has been investigated in order to determine factors of complexity in spatial relational reasoning. Several factors like the number of models, the wording of conclusion or relational complexity have been determined. Any of these factors effected reasoning. But the literature focused solemnly on positive premises. Nega...
متن کاملReasoning about Minimal Belief and Negation as
We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries, and logic programming. We characterize the complexity and provide algorith...
متن کاملReasoning with Constraints and Well-Founded Negation
Constraint reasoning and logic programming have been combined with great success. Constraint logic programming (CLP) [5] has gained a lot of interest, since it combines both fields in a theoretically sound manner while achieving efficiency by dedicated constraint solvers for practical applications. However in CLP, only Horn clauses are considered. But in many cases it is desirable also to have ...
متن کاملClosed World Reasoning for OWL2 with Negation As Failure
The Description Logic (DL)-based ontologies impose the Open World Assumption (OWA), while many other knowledge formalisms, such as the Logic Program, relational database, etc. impose the ClosedWorld Assumption (CWA). In order to interoperate knowledge bases and systems with these different representations, as well as to support applications in certain domains with complete knowledge, it is nece...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-87626-5_16