DROPS

Document

DOI: 10.4230/LIPIcs.ICLP.2011.40

Hybrid ASP

Authors: Alex Brik and Jeffrey B. Remmel

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

Abstract

This paper introduces an extension of Answer Set Programming (ASP) called Hybrid ASP which will allow 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.

Cite as

Alex Brik and Jeffrey B. Remmel. Hybrid ASP. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 40-50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{brik_et_al:LIPIcs.ICLP.2011.40,
  author =	{Brik, Alex and Remmel, Jeffrey B.},
  title =	{{Hybrid ASP}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{40--50},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.40},
  URN =		{urn:nbn:de:0030-drops-31790},
  doi =		{10.4230/LIPIcs.ICLP.2011.40},
  annote =	{Keywords: answer set programming, hybrid systems, modeling and simulation}
}

Document

DOI: 10.4230/LIPIcs.ICLP.2011.261

Extensions of Answer Set Programming

Authors: Alex Brik

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

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)

Copy BibTex To Clipboard

@InProceedings{brik:LIPIcs.ICLP.2011.261,
  author =	{Brik, Alex},
  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 =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.261},
  URN =		{urn:nbn:de:0030-drops-31846},
  doi =		{10.4230/LIPIcs.ICLP.2011.261},
  annote =	{Keywords: Answer set programming}
}

Search Results

Documents authored by Brik, Alex

Hybrid ASP

Abstract

Cite as

Extensions of Answer Set Programming

Abstract

Cite as

Thanks for your feedback!

Could not send message