Computing minimal models by partial instantiation

DOI10.1016/0304-3975(94)00216-9zbMath0873.68057OpenAlexW2038467301MaRDI QIDQ672131

Vadim Kagan, V. S. Subrahmanian

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)

Related Items (1)

Graph-based construction of minimal models

Cites Work

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

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