Computing minimal models by partial instantiation

DOI10.1016/0304-3975(94)00216-9MaRDI QIDQ672131zbMATH OpenOpenAlexFDO

Authors Vadim Kagan, V. S. Subrahmanian, Anil Nerode

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00216-9

zbMATH Keywords

groundingcomputation of structuresdisjunctive logic programminimal models of logic programs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic programming (68N17)

Recommendations

• Logic Programming
• scientific article; zbMATH DE number 1538058
• Computing minimal models, stable models and answer sets
• On computing minimal models
• Computing only minimal answers in disjunctive deductive databases

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• scientific article; zbMATH DE number 1158758 (Why is no real title available?)
• scientific article; zbMATH DE number 789391 (Why is no real title available?)
• scientific article; zbMATH DE number 3320385 (Why is no real title available?)
• An Efficient Unification Algorithm
• Computing circumscriptive databases
• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• Extended Horn sets in propositional logic
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
• Mixed integer programming methods for computing nonmonotonic deductive databases
• Solving propositional satisfiability problems
• The Specialization of Programs by Theorem Proving
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs

Cited in

(12)

• Reasoning under minimal upper bounds in propositional logic
• Foundations of the minimal model program
• scientific article; zbMATH DE number 1538058 (Why is no real title available?)
• Computation of non-ground disjunctive well-founded semantics with constraint logic programming
• Prolegomena to logic programming for non-monotonic reasoning
• Computing definite logic programs by partial instantiation
• Computing only minimal answers in disjunctive deductive databases
• Minimal Logic Programs
• Modular construction of minimal models
• scientific article; zbMATH DE number 1614696 (Why is no real title available?)
• Relating minimal models and pre-requisite-free normal defaults
• Graph-based construction of minimal models

This page was built for publication: Computing minimal models by partial instantiation

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