Graph-based construction of minimal models

DOI10.1016/J.ARTINT.2022.103754MaRDI QIDQ2093381zbMATH OpenOpenAlexFDO

Authors Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti, 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

zbMATH Keywords

disjunctive logic programsminimal modelssplitting setsstable models

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• A general theory of confluent rewriting systems for logic programming and its applications
• A logic for default reasoning
• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• A machine program for theorem-proving
• A schema for generating relevant logic programming semantics and its applications in argumentation theory
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• An incremental algorithm for generating all minimal models
• ASSAT: computing answer sets of a logic program by SAT solvers
• Characterizing diagnoses and systems
• Circumscription - a form of non-monotonic reasoning
• Computing minimal models by partial instantiation
• Computing minimal models, stable models and answer sets
• Conflict-driven answer set solving: from theory to practice
• Default reasoning using classical logic
• Depth-First Search and Linear Graph Algorithms
• Design and results of the Fifth Answer Set Programming Competition
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Engineering an Incremental ASP Solver
• Enhancing disjunctive logic programming systems by SAT checkers
• Extending and implementing the stable model semantics
• Finding optimal plans for multiple teams of robots through a mediator: a logic-based approach
• Head-Elementary-Set-Free Logic Programs
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 140388 (Why is no real title available?)
• scientific article; zbMATH DE number 741348 (Why is no real title available?)
• scientific article; zbMATH DE number 1149406 (Why is no real title available?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Minimal models vs. logic programming: the case of counterfactual conditionals
• Modular nonmonotonic logic programming revisited
• Modularity aspects of disjunctive stable models
• Multi-shot ASP solving with clingo
• On computing minimal models
• On elementary loops of logic programs
• On the complexity of identifying head-elementary-set-free programs
• On the design of coordination diagnosis algorithms for teams of situated agents
• On the tractability of minimal model computation for some CNF theories
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Propositional semantics for disjunctive logic programs
• Reasoning with minimal models: efficient algorithms and applications
• Some computational aspects of circumscription
• The complexity of minimal satisfiability problems
• The complexity of model checking for circumscriptive formulae
• The DLV system for knowledge representation and reasoning
• The Seventh Answer Set Programming Competition: Design and Results
• The Sixth Answer Set Programming Competition
• The well-founded semantics for general logic programs

Cited in

(2)

• Modular construction of minimal models
• scientific article; zbMATH DE number 177515 (Why is no real title available?)

Describes a project that uses

Uses Software

• Clingo
• Cmodels
• ASSAT

This page was built for publication: Graph-based construction of minimal models

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