publications2009.bib
@comment{{This file has been generated by bib2bib 1.98}}
@comment{{Command line: /usr/bin/bib2bib -c year=2009 publications.bib}}
@inproceedings{ikmp2009-iswc,
abstract = {RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently a W3C standard for querying RDF data, but it mostly provides means for querying simple RDF graphs only, whereas querying with respect to RDFS or other entailment regimes is left outside the current specification. In this paper, we show that SPARQL faces certain unwanted ramifications when querying ontologies in conjunction with RDF datasets that comprise multiple named graphs, and we provide an extension for SPARQL that remedies these effects. Moreover, since RDFS inference has a close relationship with logic rules, we generalize our approach to select a custom ruleset for specifying inferences to be taken into account in a SPARQL query. We show that our extensions are technically feasible by providing benchmark results for RDFS querying in our prototype system GiaBATA, which uses Datalog coupled with a persistent Relational Database as a back-end for implementing SPARQL with dynamic rule-based inference. By employing different optimization techniques like magic set rewriting our system remains competitive with state-of-the-art RDFS querying systems.},
author = {Giovambattista Ianni and Thomas Krennwallner and Alessandra Martello and Axel Polleres},
booktitle = {8th International Semantic Web Conference (ISWC 2009), Washington D.C., U.S.A., October 25--29, 2009},
conference = {http://iswc2009.semanticweb.org/},
date = {October 25-29, 2009},
date-added = {2009-08-08 22:26:31 +0200},
date-modified = {2011-08-13 09:46:20 +0200},
doi = {10.1007/978-3-642-04930-9_20},
editor = {Abraham Bernstein and David R. Karger and Tom Heath and Lee Feigenbaum and Diana Maynard and Enrico Motta and Krishnaprasad Thirunarayan},
isbn = {978-3-642-04929-3},
keywords = {SPARQL, Rule Languages, RDF, RDFS, Ontology},
location = {Washington D.C., U.S.A.},
month = oct,
pages = {310--327},
projectref = {FWF-P20841},
publisher = {Springer},
series = {LNCS},
title = {{Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regime}},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/iswc2009-dynsparql.pdf},
volume = {5823},
year = {2009},
bdsk-url-1 = {http://www.polleres.net/publications/iann-etal-2009iswc.pdf},
bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/iswc2009-dynsparql.pdf},
bdsk-url-3 = {http://dx.doi.org/10.1007/978-3-642-04930-9_20},
bdsk-url-4 = {http://iswc2009.semanticweb.org/}
}
@misc{poll-etal-2009-xsparql-language-specification,
abstract = {XSPARQL is a query language combining XQuery and SPARQL
for transformations between RDF and XML. XSPARQL subsumes XQuery and
most of SPARQL (excluding ASK and DESCRIBE). This document defines the
XSPARQL language.},
author = {Axel Polleres and Thomas Krennwallner and Nuno Lopes and Jacek Kopeck{\'y} and Stefan Decker},
date-added = {2009-06-24 05:45:57 +0200},
date-modified = {2009-06-24 05:50:03 +0200},
day = 20,
keywords = {XML, RDF, XQuery, SPARQL},
month = jan,
note = {W3C member submission},
title = {{XSPARQL Language Specification}},
url = {http://www.w3.org/Submission/xsparql-language-specification/},
year = 2009,
bdsk-url-1 = {http://www.w3.org/Submission/xsparql-language-specification/}
}
@misc{kren-etal-2009-xsparql-semantics,
abstract = {XSPARQL is a query language combining XQuery and SPARQL
for transformations between RDF and XML. This document defines the
semantics of XSPARQL.},
author = {Thomas Krennwallner and Nuno Lopes and Axel Polleres},
date-added = {2009-06-24 05:45:57 +0200},
date-modified = {2009-06-24 05:50:20 +0200},
day = 20,
keywords = {XML, RDF, XQuery, SPARQL},
month = jan,
note = {W3C member submission},
title = {{XSPARQL: Semantics}},
url = {http://www.w3.org/Submission/xsparql-semantics/},
year = 2009,
bdsk-url-1 = {http://www.w3.org/Submission/xsparql-semantics/}
}
@misc{lope-etal-2009-xsparql-implementation,
abstract = {XSPARQL is a query language combining XQuery and SPARQL
for transformations between RDF and XML. This document provides a
description of a prototype implementation of the language based on
off-the-shelf XQuery and SPARQL engines. Along with a high-level
description of the prototype the document presents a set of test queries
and their expected output which are to be understood as illustrative
help for possible other implementers.},
author = {Nuno Lopes and Thomas Krennwallner and Axel Polleres and Waseem Akhtar and St{\'ephane Corlosquet}},
date-added = {2009-06-24 05:45:57 +0200},
date-modified = {2009-06-24 05:50:26 +0200},
day = 20,
keywords = {XML, RDF, XQuery, SPARQL},
month = jan,
note = {W3C member submission},
title = {{XSPARQL: Implementation and Test-cases}},
url = {http://www.w3.org/Submission/xsparql-implementation/},
year = 2009,
bdsk-url-1 = {http://www.w3.org/Submission/xsparql-implementation/}
}
@inproceedings{defk2009-lpnmr,
abstract = {Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input from other modules, while allowing (mutually) recursive module calls. This can be used for more succinct and natural problem representation at the price of an exponential increase of evaluation time. In this paper, we aim at an efficient top-down evaluation of MLPs, considering only calls to relevant module instances. To this end, we generalize the well-known Splitting Theorem to the MLP setting and present notions of call stratification, for which we determine sufficient conditions. Call-stratified MLPs allow to split module instantiations into two parts, one for computing input of module calls, and one for evaluating the calls themselves with subsequent computations. Based on these results, we develop a top-down evaluation procedure that expands only relevant module instantiations. Finally, we discuss syntactic conditions for its exploitation.},
author = {Minh Dao-Tran and Thomas Eiter and Michael Fink and Thomas Krennwallner},
booktitle = {10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), Potsdam, Germany, September 14-18, 2009},
conference = {http://www.cs.uni-potsdam.de/lpnmr09/},
date = {September 14-18, 2009},
date-added = {2009-06-16 07:42:06 +0200},
date-modified = {2011-08-13 09:47:00 +0200},
doi = {10.1007/978-3-642-04238-6_10},
editor = {Esra Erdem and Fangzhen Lin and Torsten Schaub},
isbn = {978-3-642-04237-9},
keywords = {Modular Logic Programming, Answer Set Programming},
location = {Potsdam, Germany},
month = sep,
pages = {87--100},
projectref = {FWF-P20841, WWTF-ICT08-020, Ontorule},
publisher = {Springer},
series = {LNCS},
title = {{Relevance-driven Evaluation of Modular Nonmonotonic Logic Programs}},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/lpnmr2009-splitting.pdf},
volume = {5753},
year = {2009},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-04238-6_10},
bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/lpnmr2009-splitting.pdf},
bdsk-url-3 = {http://www.cs.uni-potsdam.de/lpnmr09/}
}
@inproceedings{ebdfik2009-frocos,
abstract = {The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative knowledge representation formalisms have been extended with the capability to access data and knowledge sources that are external to a knowledge base. This article reviews some of these formalisms that are centered around Answer Set Programming, viz. HEX-programs, modular logic programs, and multi-context systems, which were developed by the KBS group of the Vienna University of Technology in cooperation with external colleagues. These formalisms were designed with different principles and four different settings, and thus have different properties and features; however, as argued, they are not unrelated. Furthermore, they provide a basis for advanced knowledge-based information systems, which are targeted in ongoing research projects.},
author = {Thomas Eiter and Gerhard Brewka and Minh Dao-Tran and Michael Fink and Giovambattista Ianni and Thomas Krennwallner},
booktitle = {7th International Symposium on Frontiers of Combining Systems (FroCos 2009), Trento, Italy, September 16--18, 2009},
conference = {http://events.unitn.it/en/frocos09},
date = {September 16--18, 2009},
date-added = {2009-06-11 15:56:59 +0200},
date-modified = {2013-07-24 12:30:40 +0000},
doi = {10.1007/978-3-642-04222-5_2},
editor = {Silvio Ghilardi and Roberto Sebastiani},
isbn = {978-3-642-04221-8},
keywords = {Answer Set Programming, Hybrid Knowledge Base},
location = {Trento, Italy},
month = sep,
pages = {18--42},
projectref = {FWF-P20841, FWF-P20840, Ontorule, WWTF-ICT08-020},
publisher = {Springer},
series = {LNAI},
title = {{Combining Nonmonotonic Knowledge Bases with External Sources}},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/frocos2009-combining.pdf},
volume = {5749},
year = {2009},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-04222-5_2},
bdsk-url-2 = {http://events.unitn.it/en/frocos09},
bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/frocos2009-combining.pdf}
}
@inproceedings{eik2009-rw,
abstract = {Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attention during the last years. This article is a gentle introduction to the subject; it starts with motivation and follows the historical development of the challenge of defining a semantics for logic programs with negation. It looks into positive programs over stratified programs to arbitrary programs, and then proceeds to extensions with two kinds of negation (named weak and strong negation), and disjunction in rule heads. The second part then considers the ASP paradigm itself, and describes the basic idea. It shows some programming techniques and briefly overviews Answer Set solvers. The third part is devoted to ASP in the context of the Semantic Web, presenting some formalisms and mentioning some applications in this area. The article concludes with issues of current and future ASP research.},
author = {Thomas Eiter and Giovambattista Ianni and Thomas Krennwallner},
booktitle = {5th International Reasoning Web Summer School (RW 2009), Brixen/Bressanone, Italy, August 30--September 4, 2009},
conference = {http://reasoningweb.org/2009/},
date = {August 30--September 4, 2009},
date-added = {2009-06-11 15:56:52 +0200},
date-modified = {2011-08-13 09:48:10 +0200},
doi = {10.1007/978-3-642-03754-2_2},
editor = {Sergio Tessaris and Enrico Franconi and Thomas Eiter and Claudio Gutierrez and Siegfried Handschuh and Marie-Christine Rousset and Renate A. Schmidt},
isbn = {978-3-642-03753-5},
keywords = {Answer Set Programming},
location = {Brixen/Bressanone, Italy},
month = sep,
pages = {40--110},
projectref = {FWF-P20841, FWF-P20840, Ontorule},
publisher = {Springer},
series = {LNCS},
slides = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rw2009-lecture.zip},
title = {{Answer Set Programming: A Primer}},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rw2009-asp.pdf},
volume = {5689},
year = {2009},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-03754-2_2},
bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rw2009-asp.pdf},
bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rw2009-lecture.zip},
bdsk-url-4 = {http://reasoningweb.org/2009/}
}
@inproceedings{defk2009-iclp,
abstract = {Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, we focus on modular nonmonotonic logic programs (MLP) under the answer set semantics, whose modules may have contextually dependent input provided by other modules. Moreover, (mutually) recursive module calls are allowed. We define a model-theoretic semantics for this extended setting, show that many desired properties of ordinary logic programming generalize to our modular ASP, and determine the computational complexity of the new formalism. We investigate the relationship of modular programs to disjunctive logic programs with well-defined input/output interface (DLP-functions) and show that they can be embedded into MLPs.},
author = {Minh Dao-Tran and Thomas Eiter and Michael Fink and Thomas Krennwallner},
booktitle = {{25th International Conference on Logic Programming (ICLP 2009), Pasadena, California, U.S.A., July 14--17, 2009}},
conference = {http://www.ist.unomaha.edu/iclp2009/},
date = {July 14-17, 2009},
date-added = {2009-04-07 23:33:33 +0200},
date-modified = {2011-08-13 09:49:08 +0200},
doi = {10.1007/978-3-642-02846-5_16},
editor = {Patricia M. Hill and David S. Warren},
isbn = {978-3-642-02845-8},
keywords = {Knowledge Representation, Modular Logic Programming, Answer Set Programming},
location = {Pasadena, California, U.S.A.},
month = jul,
pages = {145--159},
projectref = {FWF-P20841, FWF-P20840, Ontorule, WWTF-ICT08-020},
publisher = {Springer},
series = {LNCS},
title = {{Modular Nonmonotonic Logic Programming Revisited}},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/iclp2009-mlp.pdf},
volume = {5649},
year = {2009},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-02846-5_16},
bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/iclp2009-mlp.pdf},
bdsk-url-3 = {http://www.ist.unomaha.edu/iclp2009/}
}
@incollection{deiklm2009-rewerse,
abstract = {The purpose of this chapter is to report on work that has been done in the REWERSE pro ject concerning hybrid reasoning with rules and ontologies. Two ma jor streams of work have been pursued within REWERSE. They start from the predominant semantics of non-monotonic rules in logic programming. The one stream was an extension of non-monotonic logic programs under answer set semantics, with query interfaces to external knowledge sources. The other stream, in the spirit of the AL-log approach of enhanced deductive databases, was an extension of Datalog (with the well-founded semantics, which is predominant in the database area). The former stream led to so-called non-monotonic dl-programs and hex-programs, and the latter stream to hybrid well-founded semantics. Further variants and derivations of the formalisms (like a well-founded semantics for dl-programs, respecting probabilistic knowledge, priorities, etc.) have been conceived.},
author = {Wlodzimierz Drabent and Thomas Eiter and Giovambattista Ianni and Thomas Krennwallner and Thomas Lukasiewicz and Jan Maluszynski},
booktitle = {{Semantic Techniques for the Web: The REWERSE Perspective}},
date-added = {2009-04-01 01:19:02 +0200},
date-modified = {2013-07-24 12:24:47 +0000},
doi = {10.1007/978-3-642-04581-3_1},
editor = {Francois Bry and Jan Maluszynski},
isbn = {978-3-642-04580-6},
keywords = {Nonmonotonic Reasoning, Hybrid Reasoning, Hybrid Knowledge Base, Rule Languages},
month = sep,
pages = {1--49},
projectref = {FWF-P20841, IST-REWERSE, FWF-P17212, FWF-P20840, WWTF-ICT08-020, Ontorule},
publisher = {Springer},
series = {LNCS},
title = {{Hybrid Reasoning with Rules and Ontologies}},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rewerse-ch1.pdf},
volume = {5500},
year = {2009},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-04581-3_1},
bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rewerse-ch1.pdf}
}
@inproceedings{efk2009-ijcai,
abstract = {We present a method to decompose a declarative knowledge base, given by a logic program under Answer Set Semantics with access to external sources. It overcomes the ineffectiveness of current methods due to a lack of structural information about these sources, viewed as
black boxes, by exploiting independency information in accesses to them. To this end, we develop a generic notion of domain independence that allows to restrict the evaluation domain and, as a consequence, to prune unnecessary dependency assumptions between atoms. This leads to increased decomposability; we demonstrate this by an evaluation method for HEX-programs based on program rewriting, which may yield large performance gains. While developed for a particular formalism, the notions and ideas of this paper might be adapted to related formalisms as well.},
author = {Thomas Eiter and Michael Fink and Thomas Krennwallner},
booktitle = {{Twenty-first International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, California, U.S.A., July 11--17, 2009}},
conference = {http://www.ijcai-09.org/},
date = {July 11--17, 2009},
date-added = {2009-04-01 01:16:15 +0200},
date-modified = {2011-08-13 09:53:27 +0200},
editor = {Craig Boutilier},
keywords = {Knowledge Representation, Nonmonotonic Reasoning, Hybrid Reasoning, HEX-Programs, Answer Set Programming},
location = {Pasadena, California, U.S.A.},
month = jul,
pages = {752--758},
projectref = {FWF-P20840, FWF-P20841, Ontorule, WWTF-ICT08-020},
publisher = {AAAI Press},
title = {{Decomposition of Declarative Knowledge Bases with External Functions}},
url = {http://www.ijcai.org/papers09/Papers/IJCAI09-130.pdf},
year = {2009},
bdsk-url-1 = {http://www.ijcai.org/papers09/Papers/IJCAI09-130.pdf},
bdsk-url-2 = {http://www.ijcai-09.org/}
}
@inproceedings{dek2009-ecsqaru,
abstract = {We consider a realization of Reiter-style default logic on top of description logic knowledge bases (DL-KBs). To this end, we present elegant transformations from default theories to conjunctive query (cq-)programs that combine rules and ontologies, based on different methods to find extensions of default theories. The transformations, which are implemented in a front-end to a DL-reasoner, exploit additional constraints to prune the search space via relations between default conclusions and justifications. The front-end is a flexible tool for customizing the realization, allowing to develop alternative or refined default semantics. To our knowledge, no comparable implementation is available.},
author = {Minh Dao-Tran and Thomas Eiter and Thomas Krennwallner},
booktitle = {{10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2009), Verona, Italy, July 1--3, 2009}},
conference = {http://www.isib.cnr.it/ecsqaru2009/},
date = {July 1-3, 2009},
date-added = {2009-03-09 10:43:13 +0100},
date-modified = {2011-08-13 09:53:58 +0200},
doi = {10.1007/978-3-642-02906-6_52},
editor = {Claudio Sossai and Gaetano Chemello},
isbn = {978-3-642-02905-9},
keywords = {Default Logic, Description Logics, Integration of Default Logic and Description Logic, Hybrid Reasoning},
location = {Verona, Italy},
month = jul,
pages = {602--613},
projectref = {FWF-P20840, FWF-P20841, Ontorule},
publisher = {Springer},
series = {LNAI},
slides = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/ecsqaru2009-presentation.pdf},
title = {{Realizing Default Logic over Description Logic Knowledge Bases}},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/ecsqaru2009-defaults.pdf},
volume = {5590},
year = {2009},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-02906-6},
bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-642-02906-6_52},
bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/ecsqaru2009-defaults.pdf},
bdsk-url-4 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/ecsqaru2009-presentation.pdf},
bdsk-url-5 = {http://www.isib.cnr.it/ecsqaru2009/}
}
@inproceedings{ikmp2009-eswc,
abstract = {We present GiaBATA, a system for storing, aggregating, and querying Semantic Web data, based on declarative logic programming technology, namely on the DLVHEX system, which allows us to implement a fully SPARQL compliant semantics, and on DLVDB, which extends the DLV system with persistent storage capabilities. Compared with off-the-shelf RDF stores and SPARQL engines, we offer more flexible support for rule-based RDFS and other higher entailment regimes by enabling custom reasoning via rules, and the possibility to choose the reference ontology on a per query basis. Due to the declarative approach, GiaBATA gains the possibility to apply well-known logic-level optimization features of logic programming (LP) and deductive database systems. Moreover, our architecture allows for extensions of SPARQL by non-standard features such as aggregates, custom built-ins, or arbitrary rulesets. With the resulting system we provide a flexible toolbox that embeds Semantic Web data and ontologies in a fully declarative LP environment.},
author = {Giovambattista Ianni and Thomas Krennwallner and Alessandra Martello and Axel Polleres},
booktitle = {{6th European Semantic Web Conference (ESWC 2009), Heraklion, Greece, May 31--June 4, 2009}},
conference = {http://www.eswc2009.org/},
date = {May 31-June 4, 2009},
date-added = {2009-02-24 06:52:13 +0100},
date-modified = {2011-08-13 09:54:31 +0200},
doi = {10.1007/978-3-642-02121-3_70},
editor = {Lora Arroyo and Paolo Traverso and Fabio Ciravegna and Philipp Cimiano and Tom Heath and Eero Hyv{\"o}nen and Riichiro Mizoguchi and Eyal Oren and Marta Sabou and Elena Simperl},
issn = {0302-9743},
keywords = {SPARQL, Rule Languages, RDF, RDFS, Ontology},
location = {Heraklion, Greece},
month = jun,
pages = {857--862},
poster = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/eswc2009-poster.pdf},
projectref = {FWF-P20841},
publisher = {Springer},
series = {LNCS},
slides = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/eswc2009-talk.pdf},
title = {{A Rule System for Querying Persistent RDFS Data}},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/eswc2009-giabata.pdf},
volume = {5554},
year = {2009},
bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/eswc2009-giabata.pdf},
bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-642-02121-3_70},
bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/eswc2009-talk.pdf},
bdsk-url-4 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/eswc2009-poster.pdf},
bdsk-url-5 = {http://www.eswc2009.org/}
}