publications2012.bib

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

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

@article{cikr2012-aimag,
  abstract = {The Answer Set Programming (ASP) Competition is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The competition consists of two main tracks: the ASP System Track and the Model & Solve Track. The traditional System Track compares dedicated answer set solvers on ASP benchmarks, while the Model & Solve Track invites any researcher and developer of declarative knowledge representation systems to participate in an open challenge for solving sophisticated AI problems with their tools of choice. This article provides an overview of the ASP Competition series, reviews its origins and history, giving insights on organizing and running such an elaborate event, and briefly discusses about the lessons learned so far.},
  author = {Francesco Calimeri and Giovambattista Ianni and Thomas Krennwallner and Francesco Ricca},
  date-added = {2012-09-01 14:11:47 +0000},
  date-modified = {2013-01-02 10:16:09 +0000},
  issn = {0738-4602},
  journal = {AI Magazine},
  keywords = {Answer Set Programming, Competition},
  month = {December},
  number = {4},
  pages = {114--118},
  title = {{The Answer Set Programming Competition}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/aimag2012-aspcomp.pdf},
  volume = {33},
  year = {2012},
  bdsk-url-1 = {https://www.aaai.org/Magazine/magazine.php},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/aimag2012-aspcomp.pdf}
}

@techreport{efkrs2012-rr-1843-12-08,
  address = {Favoritenstra{\ss}e 9-11, A-1040 Vienna},
  author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl and Peter Sch{\"u}ller},
  date-added = {2012-08-02 17:02:37 +0200},
  date-modified = {2012-08-02 17:05:06 +0200},
  institution = {Institut f{\"u}r Informationssysteme, TU Wien},
  keywords = {Answer Set Programming, Nonmonotonic Reasoning, Unfounded Sets, FLP Semantics},
  month = {September},
  number = {INFSYS RR-1843-12-08},
  title = {{Improving HEX-Program Evaluation based on Unfounded Sets}},
  url = {http://www.kr.tuwien.ac.at/research/reports/rr1208.pdf},
  year = {2012},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/research/reports/rr1208.pdf}
}

@proceedings{ek2012-reasoningweb,
  abstract = {This volume contains the lecture notes of the 8th Reasoning Web Summer School 2012, held in Vienna, Austria, in September 2012, in the form of worked out tutorial papers on the various topics that have been covered in that school.

The 2012 summer school program had been put together under the general leitmotif of advanced query answering topics for the Web. The idea was to address on the one hand foundations and computational aspects of query answering, in formalisms, methods and technology, and on the other hand to also spotlight some rising or emerging application fields relating to the Semantic Web in which query answering plays a role, and which by their nature also pose new challenges and problems for this task; linked stream processing, geospatial data, semantic wikis, and argumentation on the web fall in this category.},
  conference = {http://www.kr.tuwien.ac.at/events/rw2012/},
  date = {September 03-08, 2012},
  date-added = {2012-07-28 22:14:48 +0200},
  date-modified = {2013-06-22 07:29:27 +0000},
  doi = {10.1007/978-3-642-33158-9},
  editor = {Thomas Eiter and Thomas Krennwallner},
  isbn = {978-3-642-33157-2},
  issn = {0302-9743},
  keywords = {Linked Geospatial Data, Semantic Wikis, OWL, Argumentation, SPARQL, Uncertainty, Inconsistency Management, Linked Data Stream Processing, Datalog, Query Answering in Description Logics, Data Extraction},
  location = {Vienna, Austria},
  month = {September},
  publisher = {Springer},
  title = {{Reasoning Web: Semantic Technologies for Advanced Query Answering, 8th International Summer School 2012, Vienna, Austria, September 3-8, 2012}},
  url = {http://www.springer.com/978-3-642-33157-2},
  volume = {7487},
  year = {2012},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/events/rw2012/},
  bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-642-33158-9},
  bdsk-url-3 = {http://www.springer.com/computer/ai/book/978-3-642-33157-2},
  bdsk-url-4 = {http://www.springer.com/978-3-642-33157-2}
}

@inproceedings{efkrs2012-aspocp,
  abstract = {HEX-programs are an extension of the Answer Set Programming(ASP) paradigm incorporating external means of computation into the declarative programming language through so-called external atoms. Their semantics is defined in terms of minimal models of the Faber-Leone-Pfeifer (FLP) reduct. Developing native solvers for HEX-programs based on an appropriate notion of unfounded sets has been subject to recent research for reasons of efficiency. Although this has lead to an improvement over naive minimality checking using the FLP reduct, testing for foundedness remains a computationally expensive task. In this work we improve on HEX-program evaluation in this respect by identifying a syntactic class of programs, that can be efficiently recognized and allows to entirely skip the foundedness check. Moreover, we develop criteria for decomposing a program into components, such that the search for unfounded sets can be restricted. Observing that our results apply to many HEX-program applications provides analytic evidence for the significance and effectiveness of our approach, which is complemented by a brief discussion of preliminary experimental validation.},
  author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl and Peter Sch{\"u}ller},
  booktitle = {5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), September 4, 2012, Budapest, Hungary},
  conference = {https://sites.google.com/site/aspocp12/},
  date = {September 4, 2012},
  date-added = {2012-07-23 16:42:59 -0400},
  date-modified = {2012-09-06 09:57:32 +0000},
  editor = {Michael Fink and Yuliya Lierler},
  keywords = {Answer Set Programming, Nonmonotonic Reasoning, Unfounded Sets, FLP Semantics},
  location = {Budapest, Hungary},
  month = {September},
  pages = {83--97},
  projectref = {FWF-P20840, FWF-P20841, FWF-P24090, WWTF-ICT08-020},
  title = {{Eliminating Unfounded Set Checking for HEX-Programs}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/aspocp2012-elim.pdf},
  year = {2012},
  bdsk-url-1 = {http://www.irit.fr/jelia2012/},
  bdsk-url-2 = {https://sites.google.com/site/aspocp12/},
  bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/aspocp2012-elim.pdf}
}

@inproceedings{bek2012-jelia,
  abstract = {Smart Cities is a vision driven by the availability of governmental data that fosters many challenging applications. One of them is the management of inconsistent traffic regulations, i.e., the handling of inconsistent traffic signs and measures in urban areas such as wrong sign posting, or errors in data acquisition in traffic sign administration software. We investigate such inconsistent traffic scenarios and formally model traffic regulations using a logic-based approach for traffic signs and measures, and logical theories describe emerging conflicts on a graph-based street model. Founded on this model, we consider major reasoning tasks including consistency testing, diagnosis, and repair, and we analyze their computational complexity for different logical representation formalisms. Our results provide a basis for an ongoing implementation of the approach.},
  author = {Harald Beck and Thomas Eiter and Thomas Krennwallner},
  booktitle = {13th European Conference on Logics in Artificial Intelligence (JELIA 2012), September 26-28, 2012, Toulouse, France},
  conference = {http://www.irit.fr/jelia2012/},
  date = {September 26-28, 2012},
  date-added = {2012-07-23 16:37:30 -0400},
  date-modified = {2012-09-09 05:47:44 +0000},
  doi = {10.1007/978-3-642-33353-8_7},
  editor = {Luis Fari{\~n}as del Cerro and Andreas Herzig and J{\'e}r{\^o}me Mengin},
  isbn = {978-3-642-33352-1},
  keywords = {Answer Set Programming, Inconsistency Management, Traffic Regulation},
  location = {Toulouse, France},
  month = {September},
  pages = {80--93},
  projectref = {FWF-P20840, FWF-P20841, FWF-P24090, FFG-P828897},
  publisher = {Springer},
  series = {LNCS},
  title = {{Inconsistency Management for Traffic Regulations: Formalization and Complexity Results}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/jelia2012-inctraffic.pdf},
  volume = {7519},
  year = {2012},
  bdsk-url-1 = {http://www.irit.fr/jelia2012/},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/jelia2012-inctraffic.pdf},
  bdsk-url-3 = {http://dx.doi.org/10.1007/978-3-642-33353-8_7}
}

@inproceedings{efkrs2012-jelia,
  abstract = {HEX programs extend logic programs with external computations through external atoms, whose answer sets are the minimal models of the Faber-Leone-Pfeifer-reduct. As already reasoning from Horn programs with nonmonotonic external atoms of polynomial complexity is on the second level of the polynomial hierarchy, answer set checking needs special attention; simply computing reducts and searching for smaller models does not scale well. We thus extend an approach based on unfounded sets to HEX and integrate it in a Conflict Driven Clause Learning framework for HEX program evaluation. It reduces the check to a search for unfounded sets, which is more efficiently implemented as a SAT problem. We give a basic encoding for HEX and show optimizations by additional clauses. Experiments show that the new approach significantly decreases runtime.},
  author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl and Peter Sch{\"u}ller},
  booktitle = {13th European Conference on Logics in Artificial Intelligence (JELIA 2012), September 26-28, 2012, Toulouse, France},
  conference = {http://www.irit.fr/jelia2012/},
  date = {September 26-28, 2012},
  date-added = {2012-07-23 16:37:30 -0400},
  date-modified = {2012-09-09 05:44:11 +0000},
  doi = {10.1007/978-3-642-33353-8_13},
  editor = {Luis Fari{\~n}as del Cerro and Andreas Herzig and J{\'e}r{\^o}me Mengin},
  isbn = {978-3-642-33352-1},
  keywords = {Answer Set Programming, Nonmonotonic Reasoning, Unfounded Sets, FLP Semantics},
  location = {Toulouse, France},
  month = {September},
  pages = {160--175},
  projectref = {FWF-P20840, FWF-P20841, FWF-P24090},
  publisher = {Springer},
  series = {LNCS},
  title = {{Exploiting Unfounded Sets for HEX-Program Evaluation}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/jelia2012-ufsflp.pdf},
  volume = {7519},
  year = {2012},
  bdsk-url-1 = {http://www.irit.fr/jelia2012/},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/jelia2012-ufsflp.pdf},
  bdsk-url-3 = {http://dx.doi.org/10.1007/978-3-642-33353-8_13}
}

@article{bdklp2012-jods,
  abstract = {One promise of Semantic Web applications is to seamlessly deal with heterogeneous data. The Extensible Markup Language (XML) has become widely adoptedas an almost ubiquitous interchange format for data, along with transformation languages like XSLT and XQuery to translate data from one XML format into another. However, the more recent Resource Description Framework (RDF) has become another popular standard for data representation and exchange, supported by its own query language SPARQL, that enables extraction and transformation of RDF data. Being able to work with XML and RDF using a common framework eliminates several unnecessary steps that are currently required when handling both formats side by side. In this paper we present the XSPARQL language that, by combining XQuery and SPARQL, allows to query XML and RDF data using the same framework and transform data from one format into the other. We focus on the semantics of this combined language and present an implementation, including discussion of query optimisations along with benchmark evaluation.},
  author = {Stefan Bischof and Stefan Decker and Thomas Krennwallner and Axel Polleres},
  date-added = {2012-06-17 07:46:49 +0200},
  date-modified = {2012-09-13 11:32:26 +0000},
  doi = {10.1007/s13740-012-0008-7},
  issn = {1861-2032},
  journal = {Journal on Data Semantics},
  keywords = {SPARQL, XQuery, RDF, XML},
  month = {September},
  note = {Published online: 04 September 2012},
  number = {3},
  pages = {147-185},
  title = {{Mapping between RDF and XML with XSPARQL}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/jds2012-xsparql.pdf},
  volume = {1},
  year = {2012},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/jds2012-xsparql.pdf},
  bdsk-url-2 = {http://dx.doi.org/10.1007/s13740-012-0008-7}
}

@inproceedings{ekprss2012-its,
  author = {Thomas Eiter and Thomas Krennwallner and Matthias Prandtstetter and Christian Rudloff and Patrik Schneider and Markus Straub},
  booktitle = {19th ITS World Congress, Vienna, Austria, October 22--26, 2012},
  conference = {http://2012.itsworldcongress.com/},
  date = {October 22-26, 2012},
  date-added = {2012-05-07 21:39:19 +0200},
  date-modified = {2012-09-09 06:08:03 +0000},
  keywords = {Multi-Modal Routing, Ontology},
  location = {Vienna, Austria},
  month = {October},
  number = {EU-00427},
  pages = {10},
  projectref = {FWF-P20841, FWF-P24090, FFG-P828897},
  title = {{Semantically Enriched Multi-Modal Routing}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/itsworld2012-semrouting.pdf},
  year = {2012},
  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}
}

@inproceedings{bek2012-semcities,
  abstract = {Smart Cities is a vision driven by the availability of governmental data that fosters many challenging applications. One of them is the management of inconsistent traffic regulations, i.e., the handling of inconsistent traffic signs and measures in urban areas such as wrong sign posting, or errors in data acquisition in traffic sign administration software. We investigate such inconsistent traffic scenarios and formally model traffic regulations. Based on this, we consider relevant reasoning tasks including consistency testing, diagnosis, and repair, and present an implementation of the these tasks using answer set programming. The results of this research may improve existing governmental software maintaining traffic regulations.},
  author = {Harald Beck and Thomas Eiter and Thomas Krennwallner},
  booktitle = {AAAI 2012 Workshop on Semantic Cities},
  conference = {http://research.ihost.com/semanticcities12/},
  date = {July 23, 2012},
  date-added = {2012-05-07 21:36:01 +0200},
  date-modified = {2012-12-20 08:20:40 +0000},
  doi = {https://www.aaai.org/ocs/index.php/WS/AAAIW12/paper/view/5250},
  editor = {Biplav Srivastava and Freddy L{\'e}cu{\'e} and Anupam Joshi},
  keywords = {Answer Set Programming, Inconsistency Management, Traffic Regulation},
  location = {Toronto, Canada},
  month = {July},
  pages = {2-8},
  projectref = {FWF-P20841, FWF-P24090},
  publisher = {AAAI Press},
  title = {{Inconsistency Management for Traffic Regulations}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/semcities2012-inctraffic.pdf},
  year = {2012},
  bdsk-url-1 = {http://research.ihost.com/semanticcities12/},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/semcities2012-inctraffic.pdf},
  bdsk-url-3 = {https://www.aaai.org/ocs/index.php/WS/AAAIW12/paper/view/5250}
}

@article{efkr2012-tplp,
  abstract = {Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information, HEX-programs extend programs with external atoms, which allow for a bidirectional communication between the logic program and external sources of computation (e.g., description logic reasoners and Web resources). Current solvers evaluate HEX-programs by a translation to ASP itself, in which values of external atoms are guessed and verified after the ordinary answer set computation. This elegant approach does not scale with the number of external accesses in general, in particular in presence of nondeterminism (which is instrumental for ASP). In this paper, we present a novel, native algorithm for evaluating HEX-programs which uses learning techniques. In particular, we extend conflict-driven ASP solving techniques, which prevent the solver from running into the same conflict again, from ordinary to HEX-programs. We show how to gain additional knowledge from external source evaluations and how to use it in a conflict-driven algorithm. We first target the uninformed case, i.e., when we have no extra information on external sources, and then extend our approach to the case where additional meta-information is available. Experiments show that learning from external sources can significantly decrease both the runtime and the number of considered candidate compatible sets.},
  author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl},
  conference = {http://www.cs.bme.hu/iclp2012/},
  date = {September 4-8, 2012},
  date-added = {2012-05-07 21:34:07 +0200},
  date-modified = {2013-04-24 11:04:17 +0000},
  doi = {10.1017/S1471068412000233},
  issn = {1471-0684},
  journal = {Theory and Practice of Logic Programming: Special Issue 28th International Conference on Logic Programming (ICLP 2012)},
  keywords = {Answer Set Programming, Nonmonotonic Reasoning, Conflict-Driven Clause Learning, FLP Semantics},
  location = {Budapest, Hungary},
  month = {July},
  note = {Published online: 05 September 2012},
  number = {4--5},
  pages = {659--679},
  projectref = {FWF-P20841, FWF-P24090, FWF-P20840, WWTF-ICT08-020},
  title = {{Conflict-driven ASP solving with external sources}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/iclp2012-cdclhex.pdf},
  volume = {12},
  year = {2012},
  bdsk-url-1 = {http://www.cs.bme.hu/iclp2012/},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/iclp2012-cdclhex.pdf},
  bdsk-url-3 = {http://dx.doi.org/10.1017/S1471068412000233}
}

@inproceedings{eksx2012-foiks,
  abstract = {Nonmonotonic description logic programs are a major formalism for a loose coupling of rules and ontologies, formalized in logic programming and description logics, respectively. While this approach is attractive for combining systems, the impedance mismatch between different reasoning engines and the API-style interfacing are an obstacle to efficient evaluation of dl-programs in general. Uniform evaluation circumvents this by transforming programs into a single formalism, which can be evaluated on a single reasoning engine. In this paper, we consider recent and ongoing work on this approach which uses relational first-order logic (and thus relational database engines) and datalog with negation as target formalisms. Experimental data show that significant performance gains are possible and suggest the potential of this approach.},
  author = {Thomas Eiter and Thomas Krennwallner and Patrik Schneider and Guohui Xiao},
  booktitle = {7th International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2012)},
  conference = {http://2012.foiks.org/},
  date = {March 5-9, 2012},
  date-added = {2011-12-24 09:27:27 +0100},
  date-modified = {2013-07-24 12:36:22 +0000},
  doi = {10.1007/978-3-642-28472-4_1},
  editor = {Thomas Lukasiewicz and Attila Sali},
  keywords = {Description Logics, Datalog, DL-Programs, Answer Set Programming, Modular Logic Programming},
  location = {Kiel, Germany},
  month = {March},
  pages = {1--22},
  projectref = {FWF-P20840, FWF-P20841, Ontorule},
  publisher = {Springer},
  series = {LNCS},
  title = {{Uniform Evaluation of Nonmonotonic DL-Programs}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/foiks2012-uniform.pdf},
  volume = {7153},
  year = {2012},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/foiks2012-uniform.pdf},
  bdsk-url-2 = {http://2012.foiks.org/},
  bdsk-url-3 = {http://dx.doi.org/10.1007/978-3-642-28472-4_1}
}