@inproceedings{efkrs2012-jelia,
author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl and Peter Sch\"{u}ller},
booktitle = {Proceedings of the Thirteenth European Conference on Logics in Artificial Intelligence (JELIA 2012), Toulouse, France, September 26-28, 2012},
date = {September 26-28, 2012},
conference = {European Conference on Logics in Artificial Intelligence (JELIA 2012)},
keywords = {Answer Set Programming, Nonmonotonic Reasoning, Conflict-Driven Clause Learning},
title = {Exploiting Unfounded Sets for {HEX}-Program Evaluation},
location = {Toulouse, France},
month = {September},
year = {2012}
}
@inproceedings{efkrs2012-aspocp,
abstract = {{HEX}-programs are an extension of the Answer Set Programming({ASP}) paradigm incorporating external means of computation into the declarative programming language through so-called external atoms. Their semantics is defined in terms of minimal models of the Faber-Leone-Pfeifer (FLP) reduct. Developing native solvers for {HEX}-programs based on an appropriate notion of unfounded sets has been subject to recent research for reasons of efficiency. Although this has lead to an improvement over naive minimality checking using the FLP reduct, testing for foundedness remains a computationally expensive task. In this work we improve on {HEX}-program evaluation in this respect by identifying a syntactic class of programs, that can be efficiently recognized and allows to entirely skip the foundedness check. Moreover, we develop criteria for decomposing a program into components, such that the search for unfounded sets can be restricted. Observing that our results apply to many {HEX}-program applications provides analytic evidence for the significance and effectiveness of our approach, which is complemented by a brief discussion of preliminary experimental validation.},
author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl and Peter Sch{\"u}ller},
booktitle = {Fifth Workshop on Answer Set Programming and Other Computing Paradigms ({ASPOCP} 2012), September 4, 2012, Budapest, Hungary},
conference = {https://sites.google.com/site/aspocp12/},
date = {September 4, 2012},
date-added = {2012-07-23 16:42:59 -0400},
date-modified = {2012-09-06 09:57:32 +0000},
editor = {Michael Fink and Yuliya Lierler},
keywords = {Answer Set Programming, Nonmonotonic Reasoning, Unfounded Sets, FLP Semantics},
location = {Budapest, Hungary},
month = {September},
pages = {83--97},
projectref = {FWF-P20840, FWF-P20841, FWF-P24090, WWTF-ICT08-020},
title = {Eliminating Unfounded Set Checking for {HEX}-Programs},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/aspocp2012-elim.pdf},
year = {2012},
bdsk-url-1 = {http://www.irit.fr/jelia2012/},
bdsk-url-2 = {https://sites.google.com/site/aspocp12/},
bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/aspocp2012-elim.pdf}
}
@inproceedings{r2012-iclp-dc,
author = {Christoph Redl},
booktitle = {Eighth {ICLP} Doctoral Consortium, Budapest, Hungary, September 4, 2012},
title = {Answer Set Programming with External Sources},
booktitle = {ICLP (Technical Communications)},
date = {September 4, 2012},
year = {2012},
pages = {469-475},
ee = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.469},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{efkr2012-tplp,
author = {Thomas Eiter and
Michael Fink and
Thomas Krennwallner and
Christoph Redl},
title = {Conflict-driven {ASP} solving with external sources},
journal = {TPLP},
volume = {12},
number = {4--5},
year = {2012},
pages = {659-679},
ee = {http://journals.cambridge.org/action/displayAbstract?aid=8688185},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
This file was generated by bibtex2html 1.98.