publications2013.bib

@comment{{This file has been generated by bib2bib 1.98}}
@comment{{Command line: /usr/bin/bib2bib -c year=2013 publications.bib}}
@inproceedings{efkr2013-gttv,
  abstract = {Recently, liberally domain-expansion safe HEX-programs have been presented as a generalization of strongly safe HEX-programs that enlarges the scope of effective applicability. While such programs can be finitely grounded, a concrete grounding algorithm that is practically useful remained open. In this paper, we present such an algorithm and show how to integrate it into the model-building framework for HEX-programs, which is extended for this purpose. While traditional HEX-evaluation relies on program decomposition for grounding, our new algorithm can directly ground any liberally domain-expansion safe program without decomposition. However, as splitting is still sometimes useful for performance reasons, we develop a new decomposition heuristics that aims at maximizing efficiency. An experimental evaluation confirms the practicability of our approach.},
  author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl},
  booktitle = {2nd Workshop on Grounding and Transformations for Theories with Variables (GTTV'13), Corunna, Spain, September 15, 2013},
  conference = {http://gttv13.irlab.org/},
  date = {September 15, 2013},
  date-added = {2013-08-05 13:28:31 +0000},
  date-modified = {2013-12-05 10:31:36 +0000},
  editor = {David Pearce and Shahab Tasharrofi and Evgenia Ternovska and Concepci{\'o}n Vidal},
  keywords = {Answer Set Programming, Grounding, External source access},
  location = {Corunna, Spain},
  month = {September},
  pages = {3--15},
  projectref = {FWF-P20841, FWF-P24090},
  title = {{Grounding HEX-Programs with Expanding Domains}},
  url = {http://gttv13.irlab.org/sites/10.56.35.200.gttv13/files/gttv13.pdf},
  year = {2013},
  bdsk-url-1 = {http://lpnmr2013.udc.es/},
  bdsk-url-2 = {http://gttv13.irlab.org/},
  bdsk-url-3 = {http://gttv13.irlab.org/sites/10.56.35.200.gttv13/files/gttv13.pdf}
}
@inproceedings{accddikkopprrssswx2013-lpnmr,
  abstract = {Answer Set Programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. The fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. The Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm; and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language.},
  author = {Mario Alviano and Francesco Calimeri and G{\"u}nther Charwat and Minh Dao-Tran and Carmine Dodaro and Giovambattista Ianni and Thomas Krennwallner and Martin Kronegger and Johannes Oetsch and Andreas Pfandler and J{\"o}rg P{\"u}hrer and Christoph Redl and Francesco Ricca and Patrik Schneider and Martin Schwengerer and {Lara Katharina} Spendier and {Johannes Peter} Wallner and Guohui Xiao},
  booktitle = {{12th International Conference on Logic Programming and Nonmonotonic Reasoning, Corunna, Spain, September 15-19, 2013}},
  conference = {http://lpnmr2013.udc.es/},
  date = {September 15-19, 2013},
  date-added = {2013-06-22 07:21:37 +0000},
  date-modified = {2013-07-20 07:59:35 +0000},
  editor = {Pedro Cabalar and Tran Cao Son},
  keywords = {Benchmark, Competition},
  location = {Corunna, Spain},
  month = {September},
  pages = {42-53},
  projectref = {FWF-P20841, FWF-P24090},
  publisher = {Springer},
  series = {LNCS},
  title = {{The Fourth Answer Set Programming Competition: Preliminary Report}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/lpnmr2013-aspcomp.pdf},
  volume = {8148},
  year = {2013},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/lpnmr2013-aspcomp.pdf},
  bdsk-url-2 = {http://lpnmr2013.udc.es/}
}
@inproceedings{cikkprsswx2013-lpnmr,
  abstract = {System competitions evaluate solvers and compare state-of-the-art implementations on benchmark sets in a dedicated and controlled computing environment comprising of multiple hosts. An important task for running a competition is the benchmark execution platform that schedules the workload on available benchmark machines, keeps track of failed and finished jobs, and calculates the competition statistics and solver ranking. In this paper we present VCWC, the Versioning Competition Workflow Compiler.  This tool takes as input the participating solvers and dedicated benchmark sets and generates a workflow description for executing all necessary (sub-)tasks for generating the final solver rankings and statistics.  As jobs may fail during the execution, VCWC supports a gradual refinement of the competition workflow and allows to add or update solvers, instances, benchmarks, or further runs after the machinery has been brought up. We introduce an abstract model for a competition and present the implementation and system architecture for VCWC.  Based on this we report how VCWC is used for the Answer Set Programming Competition 2013.
},
  author = {G{\"u}nther Charwat and Giovambattista Ianni and Thomas Krennwallner and Martin Kronegger and Andreas Pfandler and Christoph Redl and Martin Schwengerer and Lara Spendier and Johannes Peter Wallner and Guohui Xiao},
  booktitle = {{12th International Conference on Logic Programming and Nonmonotonic Reasoning, Corunna, Spain, September 15-19, 2013}},
  conference = {http://lpnmr2013.udc.es/},
  date = {September 15-19, 2013},
  date-added = {2013-06-06 05:51:35 +0000},
  date-modified = {2013-07-20 08:00:31 +0000},
  editor = {Pedro Cabalar and Tran Cao Son},
  keywords = {Benchmark, Competition},
  location = {Corunna, Spain},
  month = {September},
  pages = {233--238},
  projectref = {FWF-P20841, FWF-P24090},
  publisher = {Springer},
  series = {LNCS},
  title = {{VCWC: A Versioning Competition Workflow Compiler}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/lpnmr2013-vcwc.pdf},
  volume = {8148},
  year = {2013},
  bdsk-url-1 = {http://lpnmr2013.udc.es/},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/lpnmr2013-vcwc.pdf}
}
@inproceedings{efkr2013-aaai,
  abstract = {Answer set programs with external source access may introduce new constants that are not present in the program, which is known as value invention. As naive value invention leads to programs with infinite grounding and answer sets, syntactic safety criteria are imposed on programs. However, traditional criteria are in many cases unnecessarily strong and limit expressiveness. We present liberal domain-expansion (de-) safe programs, a novel generic class of answer set programs with external source access that has a finite grounding and allows for value invention. De-safe programs use so-called term bounding functions as a parameter for modular instantiation with concrete---e.g., syntactic or semantic or both---safety criteria. This ensures extensibility of the approach in the future. We provide concrete instances of the framework and develop an operator that can be used for computing a finite grounding. Finally, we discuss related notions of safety from the literature, and show that our approach is strictly more expressive.},
  author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl},
  booktitle = {Twenty-Seventh AAAI Conference (AAAI 2013), July 14--18, 2013, Bellevue, Washington, USA},
  conference = {https://www.aaai.org/Conferences/AAAI/aaai13.php},
  date = {July 14--18, 2013},
  date-added = {2013-03-27 06:57:29 +0000},
  date-modified = {2013-08-08 12:46:34 +0000},
  editor = {Marie desJardins and Michael Littman},
  keywords = {Answer Set Programming, External source access, Value invention, Safety criteria, Finite grounding},
  location = {Bellevue, Washington, USA},
  month = {July},
  pages = {267--275},
  projectref = {FWF-P20840, FWF-P20841, FWF-P24090, WWTF-ICT08-020},
  publisher = {AAAI Press},
  title = {{Liberal Safety Criteria for HEX-Programs}},
  url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI13/paper/view/6209},
  year = {2013},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/aaai2013-liberalsafety.pdf},
  bdsk-url-2 = {https://www.aaai.org/Conferences/AAAI/aaai13.php},
  bdsk-url-3 = {http://www.aaai.org/ocs/index.php/AAAI/AAAI13/paper/view/6209}
}
@inproceedings{eks2013-eswc,
  abstract = {With the advent of publicly available geospatial data, ontology-based data access (OBDA) over spatial data has gained increasing interest. Spatio-relational DBMSs are used to implement geographic information systems (GIS) and are fit to manage large amounts of data and geographic objects such as points, lines, polygons, etc. In this paper, we extend the Description Logic DL-Lite with spatial objects and show how to answer spatial conjunctive queries (SCQs) over ontologies---that is, conjunctive queries with point-set topological relations such as next and within---expressed in this language. The goal of this extension is to enable an off-the-shelf use of spatio-relational DBMSs to answer SCQs using rewriting techniques, where data sources and geographic objects are stored in a database and spatial conjunctive queries are rewritten to SQL statements with spatial functions. Furthermore, we consider keyword-based querying over spatial OBDA data sources, and show how to map queries expressed as simple keyword lists describing objects of interest to SCQs, using a meta-model for completing the SCQs with spatial aspects. We have implemented our lightweight approach to spatial OBDA in a prototype and show initial experimental results using data sources such as Open Street Maps and Open Government Data Vienna from an associated project. We show that for real-world scenarios, practical queries are expressible under meta-model completion, and that query answering is computationally feasible.},
  author = {Thomas Eiter and Thomas Krennwallner and Patrik Schneider},
  booktitle = {10th Extended Semantic Web Conference (ESWC 2013), May 26-30, 2013, Montpellier, France},
  conference = {http://2013.eswc-conferences.org/},
  date = {May 26-30, 2013},
  date-added = {2013-02-23 15:40:47 +0000},
  date-modified = {2013-05-25 11:51:19 +0000},
  doi = {10.1007/978-3-642-38288-8_17},
  editor = {Philipp Cimiano and Oscar Corcho and Valentina Presutti and Laura Hollink and Sebastian Rudolph},
  isbn = {978-3-642-38287-1},
  issn = {0302-9743},
  keywords = {Description Logics, Spatial Querying, Conjunctive Queries, Keyword-Based Queries},
  location = {Montpellier, France},
  month = {May},
  pages = {243--258},
  projectref = {FWF-P20840, FFG-P828897},
  publisher = {Springer},
  series = {LNCS},
  title = {{Lightweight Spatial Conjunctive Query Answering using Keywords}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/eswc2013-spatialdllite.pdf},
  volume = {7882},
  year = {2013},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/eswc2013-spatialdllite.pdf},
  bdsk-url-2 = {http://2013.eswc-conferences.org/},
  bdsk-url-3 = {http://dx.doi.org/10.1007/978-3-642-38288-8_17}
}
@inproceedings{ekr2013-inap11,
  abstract = {Answer-Set Programming (ASP) is an established declarative programming paradigm. However, classical ASP lacks subprogram calls as in procedural programming, and access to external computations (akin to remote procedure calls) in general. This feature is desired for increasing modularity and---assuming proper access in place---(meta-)reasoning over subprogram results. While HEX-programs extend classical ASP with external source access, they do not support calls of (sub-)programs upfront. We present nested HEX-programs, which extend HEX-programs to serve the desired feature in a user-friendly manner. Notably, the answer sets of called sub-programs can be individually accessed. This is particularly useful for applications that need to reason over answer sets like belief set merging, user-defined aggregate functions, or preferences of answer sets. We will further present a novel method for rapid prototyping of external sources by the use of nested programs.},
  author = {Thomas Eiter and Thomas Krennwallner and Christoph Redl},
  booktitle = {19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)},
  conference = {http://www.kr.tuwien.ac.at/events/inap11/},
  date = {September 28-30, 2011},
  date-added = {2012-06-17 07:46:39 +0200},
  date-modified = {2013-12-05 10:56:03 +0000},
  doi = {10.1007/978-3-642-41524-1_15},
  editor = {Hans Tompits and Salvador Abreu and Johannes Oetsch and J{\"o}rg P{\"u}hrer and Dietmar Seipel and Masanobu Umeda and Armin Wolf},
  issn = {978-3-642-41523-4},
  keywords = {Answer Set Programming, HEX-Programs, Modular Logic Programming},
  location = {Vienna},
  month = {October},
  pages = {1-10},
  projectref = {FWF-P20840, FWF-P20841, FWF-P24090, WWTF-ICT08-020},
  publisher = {Springer},
  series = {LNAI},
  title = {{HEX-Programs with Nested Program Calls}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/inap2011-nestedhex.pdf},
  volume = {7773},
  year = {2013},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/nestedhex-inap11.pdf},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/events/inap11/},
  bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/inap2011-nestedhex.pdf},
  bdsk-url-4 = {http://dx.doi.org/10.1007/978-3-642-41524-1_15}
}