Extensions of Answer Set Programming

Alex Brik
This paper describes a doctoral research in three areas: Hybrid ASP - an extension of Answer Set Programming for reasoning about dynamical systems, an extension of Set Constraint atoms for reasoning about preferences, computing stable models of logic programs using Metropolis type algorithms. The paper discusses a possible application of all three areas to the problem of maximizing total expected reward.
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.