Properties and Extensions of Alternating Path Relevance - I

05/21/2019
by   David A. Plaisted, et al.
0

When proving theorems from large sets of logical assertions, it can be helpful to restrict the search for a proof to those assertions that are relevant, that is, closely related to the theorem in some sense. For example, in the Watson system, a large knowledge base must rapidly be searched for relevant facts. It is possible to define formal concepts of relevance for propositional and first-order logic. Various concepts of relevance have been defined for this, and some have yielded good results on large problems. We consider here in particular a concept based on alternating paths.We present efficient graph-based methods for computing alternating path relevance and give some results indicating its effectiveness. We also propose an alternating path based extension of this relevance method to DPLL with an improved time bound, and give other extensions to alternating path relevance intended to improve its performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2019

GREASE: A Generative Model for Relevance Search over Knowledge Graphs

Relevance search is to find top-ranked entities in a knowledge graph (KG...
research
02/14/2023

From ATL to Stit

I present a technical embedding of alternating-time temporal logic into ...
research
12/20/2018

Relevant Attributes in Formal Contexts

Computing conceptual structures, like formal concept lattices, is in the...
research
10/27/2016

Dependence and Relevance: A probabilistic view

We examine three probabilistic concepts related to the sentence "two var...
research
12/20/2017

Context-aware Path Ranking for Knowledge Base Completion

Knowledge base (KB) completion aims to infer missing facts from existing...
research
05/22/2023

On the online path extension problem – Location and routing problems in board games

We consider an online version of a longest path problem in an undirected...
research
05/26/2019

Path Ranking with Attention to Type Hierarchies

The knowledge base completion problem is the problem of inferring missin...

Please sign up or login with your details

Forgot password? Click here to reset