publications2007.bib

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

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

@techreport{akkp2007-tr20071214,
  abstract = {With currently available tools and languages, translating between an existing XML format and RDF is a tedious and error-prone task. The importance of this problem is acknowledged by the W3C GRDDL working group who faces the issue of extracting RDF data out of existing HTML or XML files, as well as by the Web service community around SAWSDL, who need to perform lowering and lifting between RDF data from a semantic client and XML messages for a Web service. However, at the moment, both these groups rely solely on XSLT transformations between RDF/XML and the respective other XML format at hand. In this report we propose a more natural approach for such transformations based on merging XQuery and SPARQL into the novel language XSPARQL. We demonstrate that XSPARQL provides concise and intuitive solutions for mapping between XML and RDF in either direction, addressing both the use cases of GRDDL and SAWSDL. We also provide and describe an initial implementation of an XSPARQL engine, available for user evaluation.},
  address = {IDA Business Park, Lower Dangan, Galway, Ireland},
  author = {Waseem Akhtar and Jacek Kopeck{\'y} and Thomas Krennwallner and Axel Polleres},
  date-added = {2007-12-13 21:23:05 +0000},
  date-modified = {2011-08-13 07:26:50 +0200},
  institution = {Digital Enterprise Research Institute, National University of Ireland, Galway},
  keywords = {SPARQL, XQuery, RDF, XML},
  month = dec,
  number = {DERI-TR-2007-12-14},
  projectref = {IST-inContext},
  title = {{XSPARQL: Traveling between the XML and RDF worlds -- and avoiding the XSLT pilgrimage}},
  type = {Technical Report},
  url = {http://www.deri.ie/fileadmin/documents/DERI-TR-2007-12-14.pdf},
  year = {2007},
  bdsk-url-1 = {http://www.deri.ie/fileadmin/documents/DERI-TR-2007-12-14.pdf}
}

@mastersthesis{tkren2007-thesis,
  abstract = {We present cq-programs, which enhance nonmonotonic description logics (dl-) programs by conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics (DL) knowledge bases, as well as disjunctive rules. dl-programs had been proposed as a powerful formalism for integrating nonmonotonic logic programming and DL reasoning on a clear semantic basis. The new cq-programs have at least two advantages. First, they offer increased expressivity by allowing general (U)CQs in the body. And second, this combination of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner by exploiting (U)CQ facilities of the DL-reasoner. To this end, we discuss some equivalences which can be exploited for program rewriting and present respective algorithms. Experimental results for the cq-program prototype show that this can lead to significant performance improvements. Moreover, the developed optimization methods may be of general interest in the context of hybrid knowledge bases. HEX-programs, which extend answer-set programming (ASP) with higher-order features and provide powerful interfacing to external computation sources, have been demonstrated to be a versatile formalism for extending the ASP paradigm. The cq-program prototype dl-plugin, which will be introduced in this work, has been developed as a plugin for dlvhex, an implementation for HEX-programs. The dl-plugin integrates ASP with description logics knowledge bases by means of external atoms. For this purpose, a partial equivalence between HEX-programs and cq-programs shows that HEX-programs can serve as a host language for our new formalism, provided that only monotonic dl-atoms appear in the cq-program.},
  address = {Karlsplatz 13, A-1040 Wien},
  author = {Thomas Krennwallner},
  date-modified = {2012-11-25 11:16:59 +0000},
  keywords = {Answer Set Programming, Conjunctive Queries, Description Logics, Disjunctive Datalog, Hybrid Knowledge Base, Nonmonotonic Reasoning, Ontology, Rule Languages},
  month = oct,
  note = {\textbf{OCG F{\"o}rderpreis 2009} (OCG advancement award 2009) for outstanding master thesis in the field of Computer Science by the Austrian Computer Society, and nominated for the Distinguished Young Alumnus/Alumna Award for outstanding Master's Thesis at the Faculty of Informatics, Vienna University of Technology.},
  projectref = {IST-REWERSE, FWF-P17212},
  school = {Vienna University of Technology},
  title = {{Integration of Conjunctive Queries over Description Logics into HEX-Programs}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2007/thesis.pdf},
  year = {2007},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2007/thesis.pdf}
}

@inproceedings{eiks2007-dl,
  abstract = {We present cq-programs, which enhance nonmonotonic description logics (dl-) programs by conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as disjunctive rules. dl-programs had been proposed as a powerful formalism for integrating nonmonotonic logic programming and DL-engines on a clear semantic basis. The new cq-programs have two advantages: First, they offer increased expressivity by allowing general (U)CQs in the body. And second, this combination of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting (U)CQ facilities of the DL-reasoner. To this end, we discuss some equivalences which can be exploited for program rewriting. Experimental results for a cq-program prototype show that this can lead to significant performance improvements.},
  author = {Thomas Eiter and Giovambattista Ianni and Thomas Krennwallner and Roman Schindlauer},
  booktitle = {20th International Workshop on Description Logics (DL 2007), Brixen/Bressanone, Italy, June 8--10, 2007},
  conference = {http://dl.kr.org/dl2007/},
  date = {June 8-10, 2007},
  date-modified = {2011-08-13 09:59:27 +0200},
  editor = {Diego Calvanese and Enrico Franconi and Volker Haarslev and Domenico Lembo and Boris Motik and Anni-Yasmin Turhan and Sergio Tessaris},
  issn = {1613-0073},
  keywords = {Conjunctive Queries, Description Logics, Hybrid Knowledge Base, Nonmonotonic Reasoning, Rule Languages; Answer Set Programming},
  location = {Brixen-Bressanone, Italy},
  month = jun,
  pages = {259--266},
  projectref = {IST-REWERSE, FWF-P17212},
  publisher = {CEUR-WS.org},
  series = {CEUR Workshop Proceedings},
  title = {{Exploiting Conjunctive Queries in Description Logic Programs}},
  url = {http://ceur-ws.org/Vol-250/paper_64.pdf},
  volume = 250,
  year = 2007,
  bdsk-url-1 = {http://ceur-ws.org/Vol-250/paper_64.pdf},
  bdsk-url-2 = {http://dl.kr.org/dl2007/}
}