scientific article; zbMATH DE number 3974342

MaRDI QIDQ3740274zbMATH OpenFDO

Authors D. A. Wolfram

Publication date 1986

zbMATH Keywords

complexity of unificationintelligent backtrackinglogic programmingNP-complete problemsPROLOG

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Intractable unifiability problems and backtracking
• Maximal unifiable subsets and minimal non-unifiable subsets
• Intelligent backtracking in deduction systems by means of extended unification graphs
• A theoretical evaluation of selected backtracking algorithms.
• scientific article; zbMATH DE number 3995082

Cited in

(7)

• Maximal unifiable subsets and minimal non-unifiable subsets
• Intelligent backtracking in deduction systems by means of extended unification graphs
• Intractable unifiability problems and backtracking
• Incremental constraint satisfaction for equational logic programming
• Intelligent backtracking in \(\text{CLP}(\Re)\)
• Recursive unsolvability of a problem of expressibility in the logic of provability
• scientific article; zbMATH DE number 3858459 (Why is no real title available?)

This page was built for publication:

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