Graph-based construction of minimal models
type: Item
instance of: scholarly article
title: Graph-based construction of minimal models
author: Fabrizio Angiulli
author: Rachel Ben-Eliyahu-Zohary
author: Fabio Fassetti
author: Luigi Palopoli
published in: Artificial Intelligence
publication date: 2022-11-08T00:00:00Z
Mathematics Subject Classification ID: 68Txx
zbMATH DE Number: 7613159
zbMATH Keywords: stable models
zbMATH Keywords: disjunctive logic programs
zbMATH Keywords: splitting sets
zbMATH Keywords: minimal models
describes a project that uses: Clingo
describes a project that uses: Cmodels
describes a project that uses: ASSAT
MaRDI profile type: Publication
full work available at URL: j.artint.2022.103754
OpenAlex ID: W4283806468
cites work: On the tractability of minimal model computation for some CNF theories
cites work: Knowledge Representation, Reasoning and Declarative Problem Solving
cites work: Q4386925
cites work: Propositional semantics for disjunctive logic programs
cites work: Default reasoning using classical logic
cites work: On computing minimal models
cites work: An incremental algorithm for generating all minimal models
cites work: Reasoning with minimal models: efficient algorithms and applications
cites work: The complexity of model checking for circumscriptive formulae
cites work: Design and results of the Fifth Answer Set Programming Competition
cites work: Modular Nonmonotonic Logic Programming Revisited
cites work: A machine program for theorem-proving
cites work: Characterizing diagnoses and systems
cites work: Q4327612
cites work: A general theory of confluent rewriting systems for logic programming and its applications
cites work: A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
cites work: On the complexity of identifying head-elementary-set-free programs
cites work: Engineering an Incremental ASP Solver
cites work: Multi-shot ASP solving with clingo
cites work: Conflict-driven answer set solving: from theory to practice
cites work: Head-Elementary-Set-Free Logic Programs
cites work: On elementary loops of logic programs
cites work: The Sixth Answer Set Programming Competition
cites work: The Seventh Answer Set Programming Competition: Design and Results
cites work: Q3983043
cites work: Q4028795
cites work: Modularity Aspects of Disjunctive Stable Models
cites work: Computing minimal models by partial instantiation
cites work: On the design of coordination diagnosis algorithms for teams of situated agents
cites work: The complexity of minimal satisfiability problems
cites work: Enhancing disjunctive logic programming systems by SAT checkers
cites work: Some computational aspects of circumscription
cites work: The DLV system for knowledge representation and reasoning
cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
cites work: ASSAT: computing answer sets of a logic program by SAT solvers
cites work: Computing minimal models, stable models and answer sets
cites work: Circumscription - a form of non-monotonic reasoning
cites work: A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory
cites work: Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
cites work: A logic for default reasoning
cites work: Minimal models vs. logic programming: the case of counterfactual conditionals
cites work: Extending and implementing the stable model semantics
cites work: Depth-First Search and Linear Graph Algorithms
cites work: The well-founded semantics for general logic programs
DOI: 10.1016/J.ARTINT.2022.103754
description: scientific article; zbMATH DE number 7613159