Minimizing function-free recursive inference rules
From MaRDI portal
Publication:3833657
DOI10.1145/58562.59303zbMath0677.68109OpenAlexW2058952316MaRDI QIDQ3833657
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
algorithmsartificial intelligenceprogramming languagesquery languageslogic programmingdeductive databaselanguagesdatabase managementdeduction and theorem provingnon-procedural languagesknowledge-baseoptimization of recursiontheory, verification
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Update operations in deductive databases with functional dependencies ⋮ One-sided recursions ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Data independent recursion in deductive databases ⋮ A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Characterization and processing of simple prefixed-chain recursion
This page was built for publication: Minimizing function-free recursive inference rules
