Graph-based construction of minimal models
From MaRDI portal
Publication:2093381
DOI10.1016/j.artint.2022.103754OpenAlexW4283806468MaRDI QIDQ2093381
Fabio Fassetti, Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luigi Palopoli
Publication date: 8 November 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103754
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the tractability of minimal model computation for some CNF theories
- Computing minimal models by partial instantiation
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- Enhancing disjunctive logic programming systems by SAT checkers
- ASSAT: computing answer sets of a logic program by SAT solvers
- Design and results of the Fifth Answer Set Programming Competition
- On the design of coordination diagnosis algorithms for teams of situated agents
- Reasoning with minimal models: efficient algorithms and applications
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Characterizing diagnoses and systems
- The complexity of model checking for circumscriptive formulae
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- On computing minimal models
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- The complexity of minimal satisfiability problems
- Propositional semantics for disjunctive logic programs
- Default reasoning using classical logic
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- An incremental algorithm for generating all minimal models
- On elementary loops of logic programs
- A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory
- On the complexity of identifying head-elementary-set-free programs
- Some computational aspects of circumscription
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Modularity Aspects of Disjunctive Stable Models
- The well-founded semantics for general logic programs
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Minimal models vs. logic programming: the case of counterfactual conditionals
- Modular Nonmonotonic Logic Programming Revisited
- The Seventh Answer Set Programming Competition: Design and Results
- Multi-shot ASP solving with clingo
- The DLV system for knowledge representation and reasoning
- The Sixth Answer Set Programming Competition
- Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
- Head-Elementary-Set-Free Logic Programs
- Computing minimal models, stable models and answer sets
- Engineering an Incremental ASP Solver
- A machine program for theorem-proving
- Depth-First Search and Linear Graph Algorithms
- A general theory of confluent rewriting systems for logic programming and its applications
This page was built for publication: Graph-based construction of minimal models
