On recursive axioms in deductive databases

DOI10.1016/0306-4379(83)90024-8zbMath0572.68086OpenAlexW2014580042WikidataQ114683679 ScholiaQ114683679MaRDI QIDQ1062477

Jack Minker, Jean-Marie Nicolas

Publication date: 1983

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0306-4379(83)90024-8

zbMATH Keywords

terminationrelational databasesrecursive rules

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (10)

Inferences for numerical dependencies ⋮ Controlling recursive inference ⋮ A hypergraph model for constraint logic programming and applications to bus drivers' scheduling ⋮ A semantic approach to optimize linear datalog programs ⋮ Using automata theory for characterizing the semantics of terminological cycles ⋮ Answering atomic queries in indefinite deductive databases ⋮ Jack Minker --- A profile ⋮ A time bound on the materialization of some recursively defined views ⋮ On the existence of nonterminating queries for a restricted class of PROLOG-clauses ⋮ Recursive query processing: The power of logic

This page was built for publication: On recursive axioms in deductive databases