Minimizing function-free recursive inference rules

DOI10.1145/58562.59303MaRDI QIDQ3833657zbMATH OpenOpenAlexFDO

Authors Jeffrey F. Naughton

Publication date 1989

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/58562.59303

zbMATH Keywords

algorithmsartificial intelligenceprogramming languagesquery languageslogic programminglanguagesdatabase managementdeduction and theorem provingdeductive databasenon-procedural languagesknowledge-baseoptimization of recursiontheory, verification

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of software (68N99)

Recommendations

• Data independent recursion in deductive databases
• Controlling recursive inference
• Fixpoint strategies for deductive databases
• Efficient evaluation for a subset of recursive queries
• scientific article; zbMATH DE number 3982568

Cited in

(9)

• On the equivalence of recursive and nonrecursive Datalog programs
• Data independent recursion in deductive databases
• Controlling recursive inference
• A tetrachotomy of ontology-mediated queries with a covering axiom
• Update operations in deductive databases with functional dependencies
• Binding propagation beyond the reach of rule/goal graphs
• Characterization and processing of simple prefixed-chain recursion
• One-sided recursions
• A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs

This page was built for publication: Minimizing function-free recursive inference rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833657)