Positive Dependency Graphs Revisited

Jorge Fandinno, Vladimir Lifschitz
7/18/2022
cs.AIcs.LO

No confident code implementation found for this paper.

Abstract

Theory of stable models is the mathematical basis of answer set programming. Several results in that theory refer to the concept of the positive dependency graph of a logic program. We describe a modification of that concept and show that the new understanding of positive dependency makes it possible to strengthen some of these results. Under consideration in Theory and Practice of Logic Programming (TPLP).

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Answer Set Programming Modulo Theories and Reasoning about Continuous Changes

81% match2025

System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers

80% match2025

On Loop Formulas with Variables

78% match2023

Graphical Conditions for the Existence, Unicity and Number of Regular Models

78% match2025

Finite Groundings for ASP with Functions: A Journey through Consistency

77% match2024

Refining Gelfond Rationality Principle Towards More Comprehensive Foundational Principles for Answer Set Semantics

77% match2025

Cite this paper

@article{fandinno2022positive,
  title  = {Positive Dependency Graphs Revisited},
  author = {Jorge Fandinno and Vladimir Lifschitz},
  year   = {2022},
  eprint = {2207.08579},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.08579v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.08579.svg)](https://codeofpaper.com/paper/2207.08579)

Discussion