Hybrid Answer Set Programming

Alex Brik,Jeffrey Remmel

doi:10.1016/j.apal.2013.07.008

Hybrid Answer Set Programming

Alex Brik, Jeffrey Remmel

Open Access

https://doi.org/10.1016/j.apal.2013.07.008

Copy DOI

Journal: Annals of Pure and Applied Logic	Publication Date: Aug 20, 2013
License type: publisher-specific-oa

Affiliation: University of California, San Diego

#Answer Set Programming #Extension Of Answer Set Programming + Show 4 more

Abstract
Full-Text PDF
Similar Papers

Abstract

This paper discusses an extension of Answer Set Programming (ASP) called Hybrid Answer Set Programming (H-ASP) which allows the user to reason about dynamical systems that exhibit both discrete and continuous aspects. The unique feature of Hybrid ASP is that it allows the use of ASP type rules as controls for when to apply algorithms to advance the system to the next position. That is, if the prerequisites of a rule are satisfied and the constraints of the rule are not violated, then the algorithm associated with the rule is invoked.

Full Text