Proceedings

An ASP Semantics for Default Reasoning with Constraints

Download BibTeX Cite

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 1015-1020.

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.

Pedro Cabalar, Roland Kaminski, Max Ostrowski, and Torsten Schaub. 2016. An ASP Semantics for Default Reasoning with Constraints. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16. IJCAI, 1015–1020. https://ijcai.org/proceedings/2016/148
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards