A Short Tutorial on s(CASP), a Goal-directed Execution of Constraint Answer Set Programs

tags

s(CASP)

Notes

The execution strategy of s(CASP) avoids the grounding phase

NOTER_PAGE: (1 . 0.3146067415730337)

can constrain variables that, as in CLP, are kept during the execution and in the answer sets

NOTER_PAGE: (1 . 0.33033707865168543)

human-understandable justifications (in natural language)

NOTER_PAGE: (1 . 0.3400749063670412)

The operational semantics of s(CASP) relies on backward chaining

NOTER_PAGE: (1 . 0.5835205992509364)

returns partial stable models

NOTER_PAGE: (1 . 0.6329588014981273)

s(CASP) is the only system that exhibits the property of relevance

NOTER_PAGE: (1 . 0.6636704119850187)

s(CASP) extends the expressiveness of Answer Set Programming systems by featuring predicates, constraints among non-ground variables, uninterpreted functions, and, most importantly, a top-down, query-driven execution strategy.

NOTER_PAGE: (3 . 0.6104868913857678)

return answers with non-ground variables

NOTER_PAGE: (3 . 0.6441947565543071)