On computing minimal models

DOI10.1007/BF02136172MaRDI QIDQ1380414zbMATH OpenFDO

Authors Rachel Ben-Eliyahu, Rina Dechter

Publication date 4 March 1998

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://escholarship.org/uc/item/4b82c43j

zbMATH Keywords

CNF propositional theory

Mathematics Subject Classification ID

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

Recommendations

• Logic Programming
• Computing minimal models, stable models and answer sets
• On the tractability of minimal model computation for some CNF theories
• scientific article; zbMATH DE number 1884398
• Modular construction of minimal models

Cites work

• A hierarchy of tractable satisfiability problems
• A sufficient condition for backtrack-bounded search
• A theory of diagnosis from first principles
• Characterizing diagnoses and systems
• Circumscription - a form of non-monotonic reasoning
• Diagnosing multiple faults
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• 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 3639144 (Why is no real title available?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Near-Horn prolog and beyond
• Network-based heuristics for constraint-satisfaction problems
• On the Complexity of Timetable and Multicommodity Flow Problems
• On the Desirability of Acyclic Database Schemes
• Polynomially solvable satisfiability problems
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Tree clustering for constraint networks
• Unification as a complexity measure for logic programming

Cited in

(34)

• Reasoning with minimal models: efficient algorithms and applications
• Semantical and computational aspects of Horn approximations
• Minimal sets on propositional formulae. Problems and reductions
• Graph-based construction of minimal models
• Foundations of the minimal model program
• Modular construction of minimal models
• An incremental algorithm for generating all minimal models
• Efficient minimal model generation using branching lemmas
• MCS Extraction with Sublinear Oracle Queries
• Computing minimal models modulo subset-simulation for modal logics
• An algorithm for enumerating maximal models of Horn theories with an application to modal logics
• Generating all maximal models of a Boolean expression
• scientific article; zbMATH DE number 7031900 (Why is no real title available?)
• Propositional SAT solving
• Algorithms for Computing Minimal Conflicts
• scientific article; zbMATH DE number 5125120 (Why is no real title available?)
• SAT-Based Horn Least Upper Bounds
• All-Termination(T)
• Minimal model generation
• On computing minimal and perfect model membership
• scientific article; zbMATH DE number 1149406 (Why is no real title available?)
• scientific article; zbMATH DE number 2026795 (Why is no real title available?)
• scientific article; zbMATH DE number 2040809 (Why is no real title available?)
• Minimal model generation with positive unit hyper-resolution tableaux
• A tableau calculus for minimal model reasoning
• scientific article; zbMATH DE number 1931664 (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
• Beyond NP: quantifying over answer sets
• Logic Programming
• Computing minimal models, stable models and answer sets
• On the difference of Horn theories
• Computing minimal models by partial instantiation
• A general framework for participatory budgeting with additional constraints

This page was built for publication: On computing minimal models

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