publications2016.bib

@comment{{This file has been generated by bib2bib 1.98}}

@comment{{Command line: /usr/bin/bib2bib -c year=2016 publications.bib}}

@article{efkr2016-aij,
  abstract = {Answer set programming (ASP) is a popular approach to declarative problem solving which for broader usability has been equipped with external source access. The latter may introduce new constants to the program (known as value invention), which can lead to infinite answer sets and non-termination; to prevent this, syntactic safety conditions on programs are common which considerably limit expressiveness (in particular, recursion). We present liberal domain-expansion (lde) safe programs, a novel generic class of ASP programs with external source access and value invention that enjoy finite restrictability, i.e., equivalence to a finite ground version. They use term bounding functions as a parametric notion of safety, which can be instantiated with syntactic, semantic or combined safety criteria; this empowers us to generalize and integrate many other notions of safety from the literature, and modular composition of criteria makes future extensions easy. Furthermore, we devise a grounding algorithm for lde-safe programs which in contrast to traditional algorithms can ground any such program directly without the need for program decomposition. While we present our approach on top of a proposed formalism in order to make the formalization precise, the general concepts carry over to related formalisms and important special cases as well. An experimental evaluation of lde-safety on various applications confirms the practicability of our approach.},
  author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl},
  date-added = {2016-01-11 20:38:45 +0000},
  date-modified = {2016-01-16 07:11:24 +0000},
  doi = {10.1016/j.artint.2016.01.003},
  issn = {0004-3702},
  journal = {Artificial Intelligence},
  keywords = {Answer set programming; Knowledge representation formalisms; Nonmonotonic reasoning; External source access; Grounding; Computational logic},
  month = {April},
  note = {Available online 7 January 2016},
  pages = {84--121},
  title = {Domain expansion for {ASP}-programs with external sources},
  volume = {233},
  year = {2016},
  bdsk-url-1 = {http://dx.doi.org/10.1016/j.artint.2016.01.003}
}

@article{ekprss2014-jitsr,
  abstract = {We present an innovative extension to routing: intention-oriented routing which is a direct result of combining classical routing-services with Semantic Web technologies. Thereby, the intention of a user can be easily incorporated into route planning. We highlight two use cases where this hybridization is of great significance: neighborhood routing, where a neighborhood can be explored (e.g. searching for events around your place) and via routing, where errands should be run along a route (e.g. buying the ingredients for dinner on your way home). We outline the combination of different methods to achieve these services, and demonstrate the emerging framework on two case studies, with a prototype extending in-use routing services.},
  author = {Thomas Eiter and Thomas Krennwallner and Matthias Prandtstetter and Christian Rudloff and Patrik Schneider and Markus Straub},
  date-added = {2014-02-06 10:37:56 +0000},
  date-modified = {2016-01-11 20:38:12 +0000},
  doi = {10.1007/s13177-014-0098-8},
  journal = {International Journal of Intelligent Transportation Systems Research},
  keywords = {Multi-Modal Routing, Ontology-Based Data Access, Semantic Web Technologies},
  month = {January},
  note = {Published online: 05 August 2014},
  number = {1},
  pages = {20--35},
  projectref = {FWF-P20841, FWF-P24090, FFG-P828897},
  title = {{Semantically Enriched Multi-Modal Routing}},
  volume = {14},
  year = {2016},
  bdsk-url-1 = {http://2012.itsworldcongress.com/},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/itsworld2012-semrouting.pdf},
  bdsk-url-3 = {http://2012.itsworldcongress.com/zone/Timetable/Event/115},
  bdsk-url-4 = {http://dx.doi.org/10.1007/s13177-014-0098-8}
}