License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2011.261
URN: urn:nbn:de:0030-drops-31846
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3184/
Go to the corresponding LIPIcs Volume Portal

Brik, Alex

Extensions of Answer Set Programming

pdf-format:
27.pdf (0.3 MB)

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.

BibTeX - Entry

@InProceedings{brik:LIPIcs:2011:3184,
  author =	{Alex Brik},
  title =	{{Extensions of Answer Set Programming }},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) },
  pages =	{261--267},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{John P. Gallagher and Michael Gelfond},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3184},
  URN =		{urn:nbn:de:0030-drops-31846},
  doi =		{10.4230/LIPIcs.ICLP.2011.261},
  annote =	{Keywords: Answer set programming}
}

Keywords: Answer set programming
Collection: Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)
Issue Date: 2011
Date of publication: 27.06.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI