Pith. sign in

REVIEW

Translating LPOD and CR-Prolog2 into Standard Answer Set Programs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.00643 v1 pith:42K5GOT4 submitted 2018-05-02 cs.AI

Joohyung Lee , Zhun Yang This is my paper · ORCID
classification cs.AI
keywords standardprogramsanswerdisjunctionorderedcr-prolog2extensionlanguage
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the construct of ordered disjunction, and CR-Prolog2 is an extension of standard answer set programs with consistency restoring rules and LPOD-like ordered disjunction. We present reductions of each of these languages into the standard ASP language, which gives us an alternative way to understand the extensions in terms of the standard ASP language.

Discussion (0). Continue with ORCID to comment.

Pith tools