Controlling recursive inference

DOI10.1016/0004-3702(86)90003-2zbMath0635.68104OpenAlexW2039099537MaRDI QIDQ1097714

Michael R. Genesereth, Matthew L. Ginsberg, David E. Smith

Publication date: 1986

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(86)90003-2

zbMATH Keywords

databasereasoningrecursive inference

Mathematics Subject Classification ID

Artificial intelligence (68T99) Information storage and retrieval of data (68P20)

Related Items (11)

Satisfiability of the smallest binary program ⋮ Default reasoning by deductive planning ⋮ Most specific logic programs ⋮ Controlling backward inference ⋮ An analysis of loop checking mechanisms for logic programs ⋮ Acquiring search-control knowledge via static analysis ⋮ Generalizing completeness results for loop checks in logic programming ⋮ On the existence of nonterminating queries for a restricted class of PROLOG-clauses ⋮ Loop checks for logic programs with functions ⋮ Detecting non-provable goals ⋮ Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques

Cites Work

• On recursive axioms in deductive databases
• Controlling backward inference
• Data independent recursion in deductive databases
• Implementation of logical query languages for databases
• On compiling queries in recursive first-order databases
• Deleting Repeated Goals in the Problem Reduction Format
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Controlling recursive inference