publications2008.bib

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

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

@article{eiks2009-amai,
  abstract = {Towards combining rules and ontologies for the Semantic Web, nonmonotonic Description Logic Programs (dl-programs) have been proposed as a powerful formalism to couple nonmonotonic logic programming and Description Logic reasoning on a clear semantic basis. In this paper, we present cq-programs, which enhance dl-programs with conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as with disjunctive rules. The novel formalism has two advantages. First, it offers increased expressivity because it allows for (U)CQs in the bodies of the rules. The (U)CQs allow one to access unnamed individuals in the rules and they increase the expressivity of the formalism, as evident from the increase in complexity from NEXP to 2-EXP. And second, when implemented as a combination between a logic programming system and a DL-reasoner, this integration of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting specific support for (U)CQs. To this end, we present equivalence preserving transformations which can be used for program rewriting, and we present respective generic rewriting algorithms. Experimental results for a cq-program prototype show that this can lead to significant performance improvements, and suggest that cq-programs and program rewriting provide a useful basis for dl- and cq-program optimization.},
  author = {Thomas Eiter and Giovambattista Ianni and Thomas Krennwallner and Roman Schindlauer},
  date-added = {2009-01-27 08:47:33 +0000},
  date-modified = {2011-08-13 07:29:33 +0200},
  doi = {10.1007/s10472-009-9111-3},
  issn = {1012-2443},
  journal = {{Annals of Mathematics and Artificial Intelligence: Logic in AI: A Special Issue Dedicated to Victor W. Marek on the Occasion of His 65th birthday}},
  keywords = {Answer Set Programming, Conjunctive Queries, Description Logics, Hybrid Knowledge Base, Nonmonotonic Reasoning, Rule Languages},
  month = aug,
  note = {Published online: 27 January 2009},
  number = {1--4},
  pages = {115--152},
  projectref = {FWF-P20840, FWF-P20841, FWF-P17212, IST-REWERSE},
  title = {{Exploiting conjunctive queries in description logic programs}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/amai2008-cqprog.pdf},
  volume = {53},
  year = {2008},
  bdsk-url-1 = {http://dx.doi.org/10.1007/s10472-009-9111-3},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/amai2008-cqprog.pdf}
}

@inproceedings{efk2008-jsc,
  author = {Thomas Krennwallner and Thomas Eiter and Michael Fink},
  booktitle = {Junior Scientist Conference (JSC 2008), Vienna, Austria, November 16--18, 2008},
  conference = {http://www.tuwien.ac.at/jsc08/},
  date = {November 16-18, 2008},
  date-added = {2008-10-19 10:42:54 +0200},
  date-modified = {2011-08-13 09:57:09 +0200},
  editor = {Hans Kaiser and Raimund Kirner},
  isbn = {978-3-200-01612-5},
  keywords = {Answer Set Programming, Hybrid Knowledge Base, Nonmonotonic Reasoning},
  location = {Vienna, Austria},
  month = nov,
  pages = {29--30},
  projectref = {FWF-P20841},
  publisher = {Vienna University of Technology},
  title = {{Decomposing HEX-Programs: Preliminary Results}},
  year = {2008},
  bdsk-url-1 = {http://www.tuwien.ac.at/jsc08/}
}

@inproceedings{eikp2008-rw,
  abstract = {Rules and ontologies play a key role in the layered architecture of the Semantic Web, as they are used to ascribe meaning to, and to reason about, data on the Web. While the Ontology Layer of the Semantic Web is quite developed, and the Web Ontology Language (OWL) is a W3C recommendation since a couple of years already, the rules layer is far less developed and an active area of research; a number of initiatives and proposals have been made so far, but no standard as been released yet. Many implementations of rule engines are around which deal with Semantic Web data in one or another way. This article gives a comprehensive, although not exhaustive, overview of such systems, describes their supported languages, and sets them in relation with theoretical approaches for combining rules and ontologies as foreseen in the Semantic Web architecture. In the course of this, we identify desired properties and common features of rule languages and evaluate existing systems against their support. Furthermore, we review technical problems underlying the integration of rules and ontologies, and classify representative proposals for theoretical integration approaches into different categories.},
  author = {Thomas Eiter and Giovambattista Ianni and Thomas Krennwallner and Axel Polleres},
  booktitle = {4th International Reasoning Web Summer School (RW 2008), Venice, Italy, September 7--11, 2008},
  conference = {http://www.reasoningweb.org/2008/},
  date = {September 7-11, 2008},
  date-added = {2008-04-21 09:59:38 +0100},
  date-modified = {2013-07-24 12:20:24 +0000},
  doi = {10.1007/978-3-540-85658-0_1},
  editor = {Cristina Baroglio and Piero A. Bonatti and Jan Maluszynski and Massimo Marchiori and Axel Polleres and Sebastian Schaffert},
  keywords = {Rule Languages, RDF, RDFS, Description Logics, Nonmonotonic Reasoning, Hybrid Knowledge Base, Ontology},
  location = {Venice, Italy},
  month = sep,
  pages = {1--53},
  projectref = {FWF-P20840, FWF-P20841},
  publisher = {Springer},
  series = {LNCS},
  slides = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/rw2008-lecture.zip},
  title = {{Rules and Ontologies for the Semantic Web}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/rowschool2008.pdf},
  volume = {5224},
  year = {2008},
  bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-540-85658-0_1},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/rw2008-lecture.zip},
  bdsk-url-3 = {http://www.reasoningweb.org/2008/},
  bdsk-url-4 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/rowschool2008.pdf}
}

@inproceedings{akkp2008-eswc,
  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.},
  author = {Waseem Akhtar and Jacek Kopeck{\'y} and Thomas Krennwallner and Axel Polleres},
  booktitle = {{5th European Semantic Web Conference (ESWC 2008), Tenerife, Canary Islands, Spain, June 1--5, 2008}},
  conference = {http://www.eswc2008.org/},
  date = {June 1-5, 2008},
  date-added = {2008-02-29 08:09:25 +0000},
  date-modified = {2012-11-25 11:15:50 +0000},
  doi = {10.1007/978-3-540-68234-9_33},
  editor = {Sean Bechhofer and Manfred Hauswirth and J{\"o}rg Hoffmann and Manolis Koubarakis},
  keywords = {SPARQL, XQuery, RDF, XML},
  location = {Tenerife, Canary Islands, Spain},
  month = jun,
  note = {Nominated for the Best Paper Award},
  pages = {432--447},
  projectref = {IST-inContext},
  publisher = {Springer},
  series = {LNCS},
  slides = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/eswc2008-talk.pdf},
  title = {{XSPARQL: Traveling between the XML and RDF Worlds - and Avoiding the XSLT Pilgrimage}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/eswc2008-xsparql.pdf},
  volume = {5021},
  year = {2008},
  bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-540-68234-9_33},
  bdsk-url-2 = {http://www.eswc2008.org/final-pdfs-for-web-site/qpI-1.pdf},
  bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/eswc2008-xsparql.pdf},
  bdsk-url-4 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2008/eswc2008-talk.pdf},
  bdsk-url-5 = {http://www.eswc2008.org/}
}

@techreport{eiks2008-rr-1843-08-02,
  abstract = {Towards combining rules and ontologies for the Semantic Web, nonmonotonic Description Logic Programs (dl-programs) have been proposed as a powerful formalism to couple nonmonotonic logic programming and Description Logic reasoning on a clear semantic basis. In this paper, we present cq-programs, which enhance dl-programs with conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as with disjunctive rules. The novel formalism has two advantages. First, it offers increased expressivity due to possible (U)CQs in the bodies of the rules. By means of this, unnamed individuals can be accessed in query evaluation, and from a complexity perspective much harder problems can be represented and solved; cq-programs over a knowledge base in the Description Logic SHIF(D), for example, can host all problems of complexity in 2-EXP via polynomial time transformations, while ordinary dl-programs can host only problems in NEXP. And second, when implemented as a combination between a logic programming system and a DL-reasoner, this integration of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting specific (U)CQ facilities that are supported. To this end, we present equivalence preserving transformations which can be used for program rewriting, and we present respective generic rewriting algorithms. Experimental results for a cq-program prototype show that this can lead to significant performance improvements, and suggest that cq-programs and program rewriting provide a useful basis for dl- and cq-program optimization.},
  address = {Favoritenstra{\ss}e 9-11, A-1040 Vienna},
  author = {Thomas Eiter and Giovambattista Ianni and Thomas Krennwallner and Roman Schindlauer},
  date-added = {2008-03-27 08:46:38 +0000},
  date-modified = {2011-08-13 07:27:05 +0200},
  institution = {Institut f{\"u}r Informationssysteme, TU Wien},
  keywords = {Answer Set Programming, Conjunctive Queries, Description Logics, Hybrid Knowledge Base, Nonmonotonic Reasoning, Rule Languages},
  month = mar,
  number = {INFSYS RR-1843-08-02},
  projectref = {IST-REWERSE, FWF-P17212},
  title = {{Exploiting Conjunctive Queries in Description Logic Programs}},
  url = {http://www.kr.tuwien.ac.at/research/reports/rr0802.pdf},
  year = {2008},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/research/reports/rr0802.pdf}
}

@inproceedings{eiks2008-isaim,
  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 and present respective algorithms. 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 = {10th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2008): Logic in Artificial Intelligence: Special Session in Honor of the 65th Birthday of Victor W. Marek, Fort Lauderdale, Florida, U.S.A., January 2--4, 2008},
  conference = {http://isaim2008.unl.edu/},
  date = {January 2-4, 2008},
  date-added = {2007-10-23 21:19:59 +0200},
  date-modified = {2011-08-13 09:58:51 +0200},
  keywords = {Answer Set Programming, Conjunctive Queries, Description Logics, Hybrid Knowledge Base, Nonmonotonic Reasoning, Rule Languages},
  location = {Fort Lauderdale, Florida, U.S.A.},
  month = jan,
  projectref = {IST-REWERSE, FWF-P17212},
  series = {ISAIM Online Proceedings},
  title = {{Exploiting Conjunctive Queries in Description Logic Programs}},
  url = {http://isaim2008.unl.edu/PAPERS/SS1-AI+Logic/TEiter-ss1.pdf},
  year = {2008},
  bdsk-url-1 = {http://isaim2008.unl.edu/PAPERS/SS1-AI+Logic/TEiter-ss1.pdf},
  bdsk-url-2 = {http://isaim2008.unl.edu/}
}