Syntactic Conditions for Antichain Property in Consistency Restoring Prolog

EasyChair Preprint 176

14 pages•Date: May 27, 2018

Abstract

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.

Keyphrases: answer set, dependency graph, logic programming, proof of literal

Links:	https://easychair.org/publications/preprint/d9P8
	https://doi.org/10.29007/rjb2

BibTeX entry

BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:

@booklet{EasyChair:176,
  author    = {Vu Phan},
  title     = {Syntactic Conditions for Antichain Property in Consistency Restoring Prolog},
  doi       = {10.29007/rjb2},
  howpublished = {EasyChair Preprint 176},
  year      = {EasyChair, 2018}}

Download PDF Open PDF in browser