Ordering conjunctive queries

DOI10.1016/0004-3702(85)90028-1zbMath0569.68077OpenAlexW2091327243MaRDI QIDQ1060862

David E. Smith, Michael R. Genesereth

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0004-3702(85)90028-1

zbMATH Keywords

conjunctive problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Investigating production system representations for non-combinatorial match ⋮ Optimization of a subclass of conjunctive queries ⋮ Controlling backward inference ⋮ A circumscriptive theorem prover ⋮ Approximating the chromatic polynomial of a graph ⋮ The optimum execution order of queries in linear storage ⋮ Cathoristic Logic ⋮ Finding optimal derivation strategies in redundant knowledge bases ⋮ A methodology for detecting shared variable dependencies in logic programs ⋮ Acquiring search-control knowledge via static analysis ⋮ Agenda control for heterogeneous reasoners ⋮ Data analysis using a geometrical representation of predicate calculus ⋮ Compiling a default reasoning system into Prolog ⋮ Bounding the cost of learned rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Controlling backward inference
• A logic for default reasoning
• Optimal problem-solving search: All-or-none solutions
• Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis