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 nonlogical axioms serve as the intensional database. The following problem is addressed: Given a recursive nonlogical axiom and the form of a potential query, can one describe a set of database retrieval requests that gives the correct answers and is guaranteed to terminate. The solution uses resolution-proof techniques over connection graphs to derive a program of relational database operations that gives all the answers to a query and has a well-defined termination condition.
ASJC Scopus subject areas
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence