TY - GEN
T1 - Conceptual pathway querying of natural logic knowledge bases from text bases
AU - Andreasen, Troels
AU - Bulskov, Henrik
AU - Nilsson, Jørgen Fischer
AU - Jensen, Per Anker
AU - Lassen, Tine
PY - 2013
Y1 - 2013
N2 - We describe a framework affording computation of conceptual pathways between a pair of terms presented as a query to a text database. In this framework, information is extracted from text sentences and becomes represented in natural logic, which is a form of logic coming much closer to natural language than predicate logic. Natural logic accommodates a variety of scientific parlance, ontologies and domain models. It also supports a semantic net or graph view of the knowledge base. This admits computation of relationships between concepts simultaneously through pathfinding in the knowledge base graph and deductive inference with the stored assertions. We envisage use of the developed pathway functionality, e.g., within bio-, pharma-, and medical sciences for calculating bio-pathways and causal chains.
AB - We describe a framework affording computation of conceptual pathways between a pair of terms presented as a query to a text database. In this framework, information is extracted from text sentences and becomes represented in natural logic, which is a form of logic coming much closer to natural language than predicate logic. Natural logic accommodates a variety of scientific parlance, ontologies and domain models. It also supports a semantic net or graph view of the knowledge base. This admits computation of relationships between concepts simultaneously through pathfinding in the knowledge base graph and deductive inference with the stored assertions. We envisage use of the developed pathway functionality, e.g., within bio-, pharma-, and medical sciences for calculating bio-pathways and causal chains.
U2 - 10.1007/978-3-642-40769-7_1
DO - 10.1007/978-3-642-40769-7_1
M3 - Article in proceedings
SN - 978-3-642-40768-0
VL - 8132
T3 - Lecture Notes in Computer Science
SP - 1
EP - 12
BT - Flexible Query Answering Systems
PB - Springer
CY - Heidelberg
ER -