Positive Dependency Graphs Revisited

07/18/2022
by   Jorge Fandinno, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2014

Characterizing and computing stable models of logic programs: The non-stratified case

Stable Logic Programming (SLP) is an emergent, alternative style of logi...
research
05/02/2009

An Application of Proof-Theory in Answer Set Programming

We apply proof-theoretic techniques in answer Set Programming. The main ...
research
04/26/2018

First-order answer set programming as constructive proof search

We propose an interpretation of the first-order answer set programming (...
research
03/18/2022

Improving Heuristic-based Process Discovery Methods by Detecting Optimal Dependency Graphs

Heuristic-based methods are among the most popular methods in the proces...
research
08/10/2019

Introduction to the 35th International Conference on Logic Programming Special Issue

We are proud to introduce this special issue of Theory and Practice of L...
research
11/20/2014

Justifying Answer Sets using Argumentation

An answer set is a plain set of literals which has no further structure ...
research
07/31/2020

Interactive Text Graph Mining with a Prolog-based Dialog Engine

On top of a neural network-based dependency parser and a graph-based nat...

Please sign up or login with your details

Forgot password? Click here to reset