On computing minimal models
type: Item
instance of: scholarly article
title: On computing minimal models
zbMATH Open document ID: 0891.68109
DOI: 10.1007/BF02136172
author: Rachel Ben-Eliyahu
author: Rina Dechter
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1998-03-04T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 1123689
zbMATH Keywords: CNF propositional theory
MaRDI profile type: Publication
cites work: On the Desirability of Acyclic Database Schemes
cites work: A hierarchy of tractable satisfiability problems
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Characterizing diagnoses and systems
cites work: Diagnosing multiple faults
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Tree clustering for constraint networks
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: A sufficient condition for backtrack-bounded search
cites work: Q4198056
cites work: Q3983043
cites work: Polynomially solvable satisfiability problems
cites work: Unification as a complexity measure for logic programming
cites work: Near-Horn prolog and beyond
cites work: Q3668890
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3939270
cites work: A theory of diagnosis from first principles
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
description: scientific article; zbMATH DE number 1123689