Syntactic Conditions for Antichain Property in Consistency Restoring Prolog

EasyChair Preprint no. 176

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

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