Syntactic Conditions for Antichain Property in Consistency Restoring Prolog

09/25/2018
by   Vu Phan, et al.
0

We study syntactic conditions which guarantee when a CR-Prolog (Consistency Restoring Prolog) program has antichain property: no answer set is a proper subset of another. A notable such condition is that the program's dependency graph being acyclic and having no directed path from one cr-rule head literal to another.

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
08/23/2018

Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model

Existing neural semantic parsers mainly utilize a sequence encoder, i.e....
research
10/20/2019

A New Connection Between Node and Edge Depth Robust Graphs

We create a graph reduction that transforms an (e, d)-edge-depth-robust ...
research
12/05/2022

Syntactic Multi-view Learning for Open Information Extraction

Open Information Extraction (OpenIE) aims to extract relational tuples f...
research
02/24/2022

Variable elimination, graph reduction and efficient g-formula

We study efficient estimation of an interventional mean associated with ...
research
01/10/2022

Bayesian Consistency with the Supremum Metric

We present simple conditions for Bayesian consistency in the supremum me...
research
07/18/2023

𝒫-matchings Parameterized by Treewidth

A matching is a subset of edges in a graph G that do not share an endpoi...

Please sign up or login with your details

Forgot password? Click here to reset