Positive Dependency Graphs Revisited

2022/07/18 by Jorge Fandinno, Fandinno, Jorge, Vladimir Lifschitz +1
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.2207.08579

openalex publication_date 2022/07/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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).

Related

• Characterizing and computing stable models of logic programs: The\n non-stratified case
• On the existence of stable models of non-stratified logic programs
• Graph-based Interpretation of Normal Logic Programs
• Graphs and colorings for answer set programming
• Stable models and an alternative logic programming paradigm