Representing infinite sequences of resolvents in recursive First-Order horn databases

Lawrence J. Henschen, Shamim A. Naqvi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

A First Order Database is defined as a function-free First-Order Theory in which the ground units serve as the Extensional Database and the proper non-logical axioms serve as the Intensional Database. This paper addresses the following problem: “Given a recursive non-logical axiom and a theorem to be proved which interacts with this axiom, can we describe a set of finite retrieval requests such that all and only the correct proofs to the theorem are found”. Our solution uses resolution-proof techniques over connection graphs to derive a program of retrieval requests from the Extensional Database that gives all the answers to a query and has a well-defined termination condition.

Original languageEnglish (US)
Title of host publication6th Conference on Automated Deduction
EditorsD.W. Loveland
PublisherSpringer Verlag
Pages342-359
Number of pages18
ISBN (Print)9783540115588
DOIs
StatePublished - Jan 1 1982
Event6th Conference on Automated Deduction, CADE 1982 - New York, United States
Duration: Jun 7 1982Jun 9 1982

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume138 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th Conference on Automated Deduction, CADE 1982
CountryUnited States
City New York
Period6/7/826/9/82

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Representing infinite sequences of resolvents in recursive First-Order horn databases'. Together they form a unique fingerprint.

Cite this