An incremental algorithm for generating all minimal models

DOI10.1016/J.ARTINT.2005.06.003MaRDI QIDQ2457647zbMATH OpenOpenAlexFDO

Authors Rachel Ben-Eliyahu-Zohary

Publication date 23 October 2007

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2005.06.003

zbMATH Keywords

Datalogdiagnosisknowledge representationlogic programmingminimal modelsnonmonotonic reasoningpropositional statisfiability

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• On computing minimal models
• scientific article; zbMATH DE number 1884398
• Reasoning with minimal models: efficient algorithms and applications
• Logic Programming
• Computing minimal models, stable models and answer sets

Cites work

• A logic for default reasoning
• A rational reconstruction of nonmonotonic truth maintenance systems
• Characterizing diagnoses and systems
• Circumscription - a form of non-monotonic reasoning
• Depth-First Search and Linear Graph Algorithms
• Diagnosing multiple faults
• Enhancing disjunctive logic programming systems by SAT checkers
• Extending and implementing the stable model semantics
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 4128783 (Why is no real title available?)
• scientific article; zbMATH DE number 1149406 (Why is no real title available?)
• scientific article; zbMATH DE number 1931693 (Why is no real title available?)
• scientific article; zbMATH DE number 1398073 (Why is no real title available?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Mixed integer programming methods for computing nonmonotonic deductive databases
• On computing minimal models
• Positive unit hyperresolution tableaux and their application to minimal model generation
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Propositional semantics for disjunctive logic programs
• Reasoning with minimal models: efficient algorithms and applications
• Some computational aspects of circumscription
• The complexity of model checking for circumscriptive formulae
• Unfolding partiality and disjunctions in stable model semantics
• Unification as a complexity measure for logic programming

Cited in

(7)

• Graph-based construction of minimal models
• scientific article; zbMATH DE number 1614696 (Why is no real title available?)
• scientific article; zbMATH DE number 177515 (Why is no real title available?)
• scientific article; zbMATH DE number 1149406 (Why is no real title available?)
• scientific article; zbMATH DE number 1884398 (Why is no real title available?)
• On the tractability of minimal model computation for some CNF theories
• Reasoning under minimal upper bounds in propositional logic

This page was built for publication: An incremental algorithm for generating all minimal models

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