Computing minimal models by partial instantiation

DOI10.1016/0304-3975(94)00216-9zbMATH Open0873.68057OpenAlexW2038467301MaRDI QIDQ672131FDOQ672131

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

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

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)

Cites Work

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

Cited In (12)

• Reasoning under minimal upper bounds in propositional logic
• Foundations of the minimal model program
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)