Reasoning with minimal models: efficient algorithms and applications

DOI10.1016/S0004-3702(97)00060-XzbMATH Open0903.68178OpenAlexW2103797177MaRDI QIDQ1127346

Rachel Ben-Eliyahu-Zohary, Luigi Palopoli

Publication date: 13 August 1998

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(97)00060-x

zbMATH Keywords

disjunctive logic programslinear time algorithmsminimal modelsstable model semanticsdisjunctive databasesdisjunctive default logic

Mathematics Subject Classification ID

Knowledge representation (68T30) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Propositional semantics for disjunctive logic programs
• Depth-First Search and Linear Graph Algorithms
• The complexity of satisfiability problems
• Diagnosing multiple faults
• Characterizing diagnoses and systems
• The complexity of model checking for circumscriptive formulae
• On computing minimal models
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Unification as a complexity measure for logic programming
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Some computational aspects of circumscription
• A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference
• Mixed integer programming methods for computing nonmonotonic deductive databases
• Negation and minimality in disjunctive databases
• Default reasoning using classical logic
• Programming with non-determinism in deductive databases
• On the impact of stratification on the complexity of nonmonotonic reasoning

Cited In (14)

• Optimizing Answer Set Computation via Heuristic-Based Decomposition
• An incremental algorithm for generating all minimal models
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• Paracoherent answer set computation
• Reasoning under minimal upper bounds in propositional logic
• Minimal sets on propositional formulae. Problems and reductions
• On the complexity of identifying head-elementary-set-free programs
• Propositional SAT Solving
• On the tractability of minimal model computation for some CNF theories
• Title not available (Why is that?)
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Enhancing disjunctive logic programming systems by SAT checkers
• Graph-based construction of minimal models
• Complexity results for answer set programming with bounded predicate arities and implications

This page was built for publication: Reasoning with minimal models: efficient algorithms and applications

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