Extensions of Answer Set Programming

Brik, Alex

doi:10.4230/LIPIcs.ICLP.2011.261

Document

Extensions of Answer Set Programming

Author Alex Brik

Part of: Volume: Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (ICLP 2011)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Logic Programming (ICLP)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2011-06-27

PDF

File

PDF

LIPIcs.ICLP.2011.261.pdf

Filesize: 284 kB
7 pages

Document Identifiers

DOI: 10.4230/LIPIcs.ICLP.2011.261
URN: urn:nbn:de:0030-drops-31846

Subject Classification

Keywords

Answer set programming

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get BibTex

Alex Brik. Extensions of Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 261-267, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011) https://doi.org/10.4230/LIPIcs.ICLP.2011.261

Author Details

Alex Brik

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail