Incremental methods for optimizing partial instantiation

DOI10.1007/3-540-59487-6_21MaRDI QIDQ5101457zbMATH OpenOpenAlexFDO

Authors Raymond T. Ng, Xiaomei Tian

Publication date 30 August 2022

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59487-6_21

Mathematics Subject Classification ID

Mixed integer programming (90C11) Logic programming (68N17)

Recommendations

• Incremental algorithms for optimizing model computation based on partial instantiation
• Partial deduction in disjunctive logic programming
• Efficient instance retrieval of subgoals for subsumptive tabled evaluation of logic programs
• scientific article; zbMATH DE number 1324220
• Partial evaluation of queries in deductive databases

Cites work

• scientific article; zbMATH DE number 88998 (Why is no real title available?)
• An Efficient Unification Algorithm
• Computing definite logic programs by partial instantiation
• Extended Horn sets in propositional logic
• Mixed integer programming methods for computing nonmonotonic deductive databases

Cited in

(3)

• scientific article; zbMATH DE number 53489 (Why is no real title available?)
• A thorough treatment of highly-efficient NTRU instantiations
• Incremental algorithms for optimizing model computation based on partial instantiation

This page was built for publication: Incremental methods for optimizing partial instantiation

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