Computing definite logic programs by partial instantiation

DOI10.1016/0168-0072(94)90010-8zbMath0793.68033OpenAlexW2037474536MaRDI QIDQ1326778

Vadim Kagan, V. S. Subrahmanian

Publication date: 21 August 1994

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)90010-8

zbMATH Keywords

linear programmingquery processingdeductive databaseslogic program computationsresolution with unification

Mathematics Subject Classification ID

Linear programming (90C05) Logic programming (68N17)

Related Items (2)

Many-valued logic and mixed integer programming ⋮ Incremental methods for optimizing partial instantiation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing circumscriptive databases
• Solving propositional satisfiability problems
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• An Efficient Unification Algorithm
• Extended Horn sets in propositional logic
• Mixed integer programming methods for computing nonmonotonic deductive databases

This page was built for publication: Computing definite logic programs by partial instantiation