A Non-Commutative Bilinear Model for Answering Path Queries in Knowledge Graphs

doi 10.18653/v1/d19-1246
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics

Related search

Query Driven Hypothesis Generation for Answering Queries Over NLP Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On Quasi-Zero Divisor Graphs of Non-Commutative Rings

Algebraic Structures and their Applications
Applied MathematicsNumber TheoryAlgebra
2018English

Answering Graph Pattern Queries Using Views

2014English

A Strongly Polynomial Algorithm for Finding a Shortest Non-Zero Path in Group-Labeled Graphs

2020English

Complexity of Answering Queries Using Materialized Views

1998English

The Need for Ancestor Resolution When Answering Queries in Horn Clause Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Shortest Path Queries in Rectilinear Worlds

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1992English

A Question Understanding Model Based on Knowledge Points for Chinese Question Answering Service in E-Learning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Answering Complex SQL Queries Using Automatic Summary Tables

2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy