An ASP Semantics for Default Reasoning with Constraints

Abstract

We introduce the logic of Here-and-There with Constraints in order to capture constraint theories in the non-monotonic setting known from Answer Set Programming (ASP). This allows for assigning default values to constraint variables or to leave them undefined. Also, it provides us with a semantic framework integrating ASP and Constraint Processing in a uniform way. We put some emphasis on logic programs dealing with linear constraints on integer variables, where we further introduce a directional assignment operator. We elaborate upon the formal relation and implementation of these programs in terms of Constraint ASP, sketching an existing system. PDF

Cite

Text

Cabalar et al. "An ASP Semantics for Default Reasoning with Constraints." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Cabalar et al. "An ASP Semantics for Default Reasoning with Constraints." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/cabalar2016ijcai-asp/)

BibTeX

@inproceedings{cabalar2016ijcai-asp,
  title     = {{An ASP Semantics for Default Reasoning with Constraints}},
  author    = {Cabalar, Pedro and Kaminski, Roland and Ostrowski, Max and Schaub, Torsten},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {1015-1021},
  url       = {https://mlanthology.org/ijcai/2016/cabalar2016ijcai-asp/}
}