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

Lecture Notes in Computer Science - Germany
doi 10.1007/11562931_33
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A General Similarity Framework for Horn Clause Logic

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Horn Clause Programs With Polymorphic Types: Semantics and Resolution

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Answering Graph Pattern Queries Using Views

2014English

Query Driven Hypothesis Generation for Answering Queries Over NLP Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Complexity of Answering Queries Using Materialized Views

1998English

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

2019English

Efficient Model Construction for Horn Logic With VLog

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Answering Complex SQL Queries Using Automatic Summary Tables

2000English

Complexity of Answering Counting Aggregate Queries Over DL-Lite

SSRN Electronic Journal
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy