publications2011.bib

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

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

@inproceedings{ekr2011-inap,
  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 (like remote procedure calls) in general. The 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 over answer sets.
},
  author = {Thomas Eiter and Thomas Krennwallner and Christoph Redl},
  booktitle = {19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011), Vienna, Austria, September 28--30, 2011},
  conference = {http://www.kr.tuwien.ac.at/events/inap11/},
  date = {September 28-30, 2011},
  date-added = {2011-08-13 07:20:16 +0200},
  date-modified = {2011-09-20 18:16:44 +0200},
  editor = {Hans Tompits},
  keywords = {Answer Set Programming, HEX-Programs, Modular Logic Programming},
  location = {Vienna, Austria},
  month = {September},
  number = {arXiv:1108.5626v1},
  projectref = {FWF-P20840, FWF-P20841, Ontorule},
  publisher = {Computing Research Repository (CoRR)},
  series = {arXiv},
  title = {{Nested HEX-Programs}},
  url = {http://arxiv.org/abs/1108.5626},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/inap2011-nestedhex.pdf},
  bdsk-url-2 = {http://www.kr.tuwien.ac.at/events/inap11/},
  bdsk-url-3 = {http://arxiv.org/abs/1108.5626}
}

@inproceedings{ekr2011-wcb,
  abstract = {Decision diagrams (DDs) are a popular means for decision making, e.g., in clinical guidelines.  Some applications require to integrate multiple related yet different diagrams into a single one, for which algorithms have been developed. However, existing merging tools are monolithic, application-tailored programs with no clear interface to the actual merging procedures, which makes their reuse hard if not impossible.  We present a general, declarative framework for merging and manipulating decision diagram tasks based on a belief set merging framework. Its modular architecture hides details of the merging algorithm and supports pre- and user-defined merging operators, which can be flexibly arranged in merging plans to express complex merging tasks. Changing and restructuring merging tasks becomes easy, and relieves the user from (repetitive) manual integration to focus on experimenting with different merging strategies, which is vital for applications, as discussed for an example from DNA classification. Our framework supports also reasoning over DDs using answer set programming (ASP), which allows to drive the merging process and select results based on the application needs.
},
  author = {Thomas Eiter and Thomas Krennwallner and Christoph Redl},
  booktitle = {Workshop on Constraint Based Methods for Bioinformatics (WCB 2011), Perugia, Italy, September 12, 2011},
  conference = {http://www.dmi.unipg.it/WCB11/},
  date = {September 12, 2011},
  date-added = {2011-07-31 10:56:01 +0200},
  date-modified = {2011-08-25 15:16:59 +0200},
  editor = {Alessandro Dal Pal{\`u} and Agostino Dovier and Andrea Formisano},
  keywords = {Answer Set Programming, Nonmonotonic Reasoning, Decision Diagram Merging},
  location = {Perugia, Italy},
  month = {September},
  pages = {3--15},
  projectref = {FWF-P20840, FWF-P20841, WWTF-ICT08-020},
  publisher = {Dipartimento di Matematica e Informatica, Universita degli Studi di Perugia},
  title = {Declarative Merging of and Reasoning about Decision Diagrams},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/wcb11-ddmerge.pdf},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/wcb11-ddmerge.pdf},
  bdsk-url-2 = {http://www.dmi.unipg.it/WCB11/}
}

@inproceedings{krennwallner2011-iclp,
  abstract = {Modularity in Logic Programming has gained much attention over the past years. To date, many formalisms have been proposed that feature various aspects of modularity. In this paper, we present our current work on Modular Nonmonotonic Logic Programs (MLPs), which are logic programs under answer set semantics with modules that have contextualized input provided by other modules. Moreover, they allow for (mutually) recursive module calls. We pinpoint issues that are present in such cyclic module systems and highlight how MLPs addresses them.},
  author = {Thomas Krennwallner},
  booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP 2011), Lexington, Kentucky, U.S.A., July 6--10, 2011},
  conference = {http://cmt.math.unipr.it/iclp-dc-2011/},
  date = {July 6-10, 2011},
  date-added = {2011-05-11 12:16:29 +0200},
  date-modified = {2012-11-25 11:14:23 +0000},
  doi = {10.4230/LIPIcs.ICLP.2011.274},
  editor = {John Gallagher and Michael Gelfond},
  isbn = {978-3-939897-31-6},
  issn = {1868-8969},
  keywords = {Knowledge Representation, Nonmonotonic Reasoning, Modular Logic Programming, Answer Set Programming},
  location = {Lexington, Kentucky, U.S.A.},
  month = {July},
  note = {\textbf{Best Student Presentation} ICLP Doctoral Consortium 2011},
  pages = {274--279},
  projectref = {FWF-P20841, WWTF-ICT08-020, Ontorule},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  title = {{Promoting Modular Nonmonotonic Logic Programs}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/iclp2011dc-mlp.pdf},
  volume = {11},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/iclp2011dc-mlp.pdf},
  bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2011.274},
  bdsk-url-3 = {http://cmt.math.unipr.it/iclp-dc-2011/}
}

@inproceedings{defk2011-logic,
  abstract = {Multi-Context Systems (MCS) are instances of a nonmonotonic formalism for interlinking heterogeneous knowledge bases in a way such that the information flow is in equilibrium. Recently, algorithms for evaluating distributed MCS have been proposed which compute global system models, called equilibria, by local computation and model exchange.  Unfortunately, they suffer from a bottleneck that stems from the way models are exchanged, which limits the applicability to situations with small information interfaces. To push MCS to more realistic and practical scenarios, we present a novel algorithm that computes at most $k\geq 1$ models of an MCS using asynchronous communication. Models are wrapped into packages, and contexts in an MCS continuously stream packages to generate at most~$k$ models at the root of the system. We have implemented this algorithm in a new solver for distributed MCS, and show promising experimental results.},
  author = {Minh Dao-Tran and Thomas Eiter and Michael Fink and Thomas Krennwallner},
  booktitle = {2nd International Workshop on Logic-based Interpretation of Context: Modeling and Applications (Log-IC 2011), Vancouver, British Columbia, Canada, May 16, 2011},
  conference = {http://log-ic2011.deri.ie/},
  date = {May 16, 2011},
  date-added = {2011-04-28 17:11:40 +0200},
  date-modified = {2011-08-13 09:40:49 +0200},
  editor = {Alessandra Mileo and Michael Fink},
  issn = {1613-0073},
  keywords = {Multi-Context Systems, Decentralized Model Computation, Nonmonotonic Reasoning},
  location = {Vancouver, British Columbia, Canada},
  month = {May},
  pages = {11--22},
  projectref = {FWF-P20841, WWTF-ICT08-020, Ontorule},
  publisher = {CEUR-WS.org},
  series = {CEUR Workshop Proceedings},
  title = {{Model Streaming for Distributed Multi-Context Systems}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/log-ic2011-modstreaming.pdf},
  urn = {urn:nbn:de:0074-738-1},
  volume = {738},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/log-ic2011-modstreaming.pdf},
  bdsk-url-2 = {http://log-ic2011.deri.ie/}
}

@techreport{bdklp2011-tr20110404,
  abstract = {One of the promises of Semantic Web applications is to seamlessly deal with heterogeneous data. While the Extensible Markup Language (XML) has become widely adopted as an almost ubiquitous interchange format for data, along with transformation languages like XSLT and XQuery to translate from one XML format into another, the more recent Resource Description Framework (RDF) has become another popular standard for data representation and exchange, supported by its own powerful query language SPARQL, that enables extraction and transformation of RDF data. Being able to work with these two languages using a common framework eliminates several unnecessary steps that are currently necessary when handling both formats side by side. In this report we present the XSPARQL language that, by combining XQuery and SPARQL, allows to query XML and RDF data using the same framework and, respectively transform 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.},
  address = {IDA Business Park, Lower Dangan, Galway, Ireland},
  author = {Stefan Bischof and Stefan Decker and Thomas Krennwallner and Nuno Lopes and Axel Polleres},
  date-added = {2011-04-05 04:34:34 +0200},
  date-modified = {2011-08-13 07:44:24 +0200},
  institution = {Digital Enterprise Research Institute, National University of Ireland, Galway},
  keywords = {SPARQL, XQuery, RDF, XML},
  month = {April},
  number = {DERI-TR-2011-04-04},
  pages = {44},
  projectref = {Ontorule},
  title = {{Mapping between RDF and XML with XSPARQL}},
  type = {{Technical Report}},
  url = {http://www.deri.ie/fileadmin/documents/DERI-TR-2011-04-04.pdf},
  year = {2011},
  bdsk-url-1 = {http://www.deri.ie/fileadmin/documents/DERI-TR-2011-04-04.pdf}
}

@incollection{defk2011-nonmon30,
  abstract = {Nonmonotonic multi-context systems (MCS) provide a formalism to represent knowledge exchange between heterogeneous and possibly nonmonotonic knowledge bases (contexts). Recent advancements to evaluate MCS semantics (given in terms of so-called equilibria) enable their application to realistic and fully distributed scenarios of knowledge exchange. However, the current MCS formalism cannot handle open environments, i.e., when knowledge sources and their contents may change over time and are not known a priori. To improve on this aspect, we develop {Dynamic Nonmonotonic Multi-Context Systems}, which consist of schematic contexts that allow to leave part of the information interlinkage open at design time. A concrete interlinking is established by a configuration step at run time, where concrete contexts and information imports between them are fixed. We formally develop a corresponding extension and provide semantics by instantiation to ordinary MCS. Furthermore, we develop a basic distributed configuration algorithm and discuss several refinements that affect the resulting configurations, in particular by means of optimizations according to different quality criteria. This discussion is complemented with experimental results obtained with a corresponding prototype implementation.},
  address = {London},
  author = {Minh Dao-Tran and Thomas Eiter and Michael Fink and Thomas Krennwallner},
  booktitle = {Nonmonotonic Reasoning, Essays Celebrating its 30th Anniversary, Lexington, Kentucky, U.S.A., October 22--25, 2010},
  conference = {https://sites.google.com/site/nonmonat30/},
  date = {October 22-25, 2010},
  date-added = {2011-04-05 04:32:42 +0200},
  date-modified = {2012-01-10 06:41:18 +0100},
  editor = {Gerhard Brewka and Victor Marek and Miroslaw Truszczynski},
  isbn = {978-1-84890-042-4},
  keywords = {Multi-Context Systems, Decentralized Model Computation, Nonmonotonic Reasoning},
  location = {Lexington, Kentucky, U.S.A.},
  month = {July},
  pages = {63--88},
  projectref = {FWF-P20841, WWTF-ICT08-020, Ontorule},
  publisher = {College Publications},
  series = {Studies in Logic},
  title = {{Dynamic Distributed Nonmontonic Multi-Context Systems}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/nonmon30-dynmcs.pdf},
  volume = {31},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/nonmon30-dynmcs.pdf},
  bdsk-url-2 = {https://sites.google.com/site/nonmonat30/}
}

@inproceedings{defkw2011-lpnmr,
  abstract = {Heterogeneous nonmonotonic multi-context systems (MCS) permit different logics to be used in different contexts, and link them via bridge rules. We investigate the role of symmetry detection and symmetry breaking in such systems to eliminate symmetric parts of the search space and, thereby, simplify the evaluation process. We propose a distributed algorithm that takes a local stance, i.e., computes independently the partial symmetries of a context and, in order to construct potential symmetries of the whole, combines them with those partial symmetries returned by neighbouring contexts. We prove the correctness of our methods. We instantiate such symmetry detection and symmetry breaking in a multi-context system with contexts that use answer set programs, and demonstrate computational benefit on some recently proposed benchmarks.},
  author = {Christian Drescher and Thomas Eiter and Michael Fink and Thomas Krennwallner and Toby Walsh},
  booktitle = {11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011), Vancouver, British Columbia, Canada, May 16-19, 2011},
  conference = {https://sites.google.com/site/lpnmr11/},
  date = {May 16-19, 2011},
  date-added = {2011-02-09 15:22:53 +0100},
  date-modified = {2011-08-13 09:41:16 +0200},
  doi = {10.1007/978-3-642-20895-9_5},
  editor = {James Delgrande and Wolfgang Faber},
  keywords = {Nonmonotonic Reasoning, Decentralized Model Computation, Symmetry Breaking},
  location = {Vancouver, British Columbia, Canada},
  month = {May},
  pages = {26--39},
  projectref = {FWF-P20841, WWTF-ICT08-020, Ontorule},
  publisher = {Springer},
  series = {LNAI},
  title = {{Symmetry Breaking for Distributed Multi-Context Systems}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/lpnmr2011-symmcs.pdf},
  volume = {6645},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/lpnmr2011-symmcs.pdf},
  bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-642-20895-9_5},
  bdsk-url-3 = {https://sites.google.com/site/lpnmr11/}
}

@inproceedings{efiks2011-lpnmr,
  abstract = {The evaluation of logic programs with access to external knowledge sources requires to interleave external computation and model building. Deciding where and how to stop with one task and proceed with the next is a difficult problem, and existing approaches have severe deficiencies for many real-world application scenarios. We introduce a new approach for organizing the evaluation of logic programs with external knowledge sources and describe a configurable framework for dividing the non-ground program into not necessarily disjoint smaller parts, the evaluation units. These units will then be processed by interlacing external evaluations and model building, and combining intermediate results. Experiments with our prototype implementation show that the technique significantly improves on existing approaches. Even for logic programs without any external computations, in some cases our approach speeds up existing solvers by decomposing the program, feeding it to the solver in pieces, and combining the result.},
  author = {Thomas Eiter and Michael Fink and Giovambattista Ianni and Thomas Krennwallner and Peter Sch{\"u}ller},
  booktitle = {11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011), Vancouver, British Columbia, Canada, May 16-19, 2011},
  conference = {https://sites.google.com/site/lpnmr11/},
  date = {May 16-19, 2011},
  date-added = {2011-02-09 15:22:48 +0100},
  date-modified = {2011-08-13 09:41:33 +0200},
  doi = {10.1007/978-3-642-20895-9_10},
  editor = {James Delgrande and Wolfgang Faber},
  keywords = {HEX-Programs, Answer Set Programming, Nonmonotonic Reasoning},
  location = {Vancouver, British Columbia, Canada},
  month = {May},
  note = {\textbf{Best Paper} \url{http://ijcai-11.iiia.csic.es/program/best_paper_track}},
  pages = {93--106},
  projectref = {FWF-P20841, WWTF-ICT08-020, Ontorule},
  publisher = {Springer},
  series = {LNAI},
  title = {{Pushing Efficient Evaluation of HEX Programs by Modular Decomposition}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/lpnmr2011-hexdecompeval.pdf},
  volume = {6645},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/lpnmr2011-hexdecompeval.pdf},
  bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-642-20895-9_10},
  bdsk-url-3 = {https://sites.google.com/site/lpnmr11/}
}

@inproceedings{defk2011-datalog20,
  abstract = {Recently Modular Nonmonotonic Logic Programs (MLP) have been introduced which incorporate a call-by-value mechanism and allow for unrestricted calls between modules, including mutual and self recursion, as an approach to provide module constructs akin to those in conventional programming in Nonmonotonic Logic Programming under Answer Set Semantics. This paper considers MLPs in a Datalog setting and provides characterizations of their answers sets in terms of classical (Herbrand) models of a first-order formula, extending a line of research for ordinary logic programs. To this end, we lift the well-known loop formulas method to MLPs, and we also consider the recent ordered completion approach that avoids explicit construction of loop formulas using auxiliary predicates. Independent of computational perspectives, the novel characterizations widen our understanding of MLPs and they may prove useful for semantic investigations.},
  author = {Minh Dao-Tran and Thomas Eiter and Michael Fink and Thomas Krennwallner},
  booktitle = {Datalog Reloaded, 1st International Workshop on Datalog 2010, Oxford, UK, March 16--19, 2010},
  conference = {http://datalog20.org/},
  date = {March 16-19, 2010},
  date-added = {2010-11-18 18:42:13 +0100},
  date-modified = {2011-12-15 07:08:37 +0100},
  editor = {Oege de Moor and Georg Gottlob and Tim Furche and Andrew Sellers},
  isbn = {978-3-642-24205-2},
  keywords = {Answer Set Programming, Nonmonotonic Reasoning, Modular Logic Programming},
  location = {Oxford, U.K.},
  month = {December},
  pages = {59--77},
  projectref = {FWF-P20841, WWTF-ICT08-020, Ontorule},
  publisher = {Springer},
  series = {LNCS},
  title = {{First-Order Encodings of Modular Nonmonotonic Logic Programs}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/datalog20-fomlp.pdf},
  volume = {6702},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/datalog20-fomlp.pdf},
  bdsk-url-2 = {http://datalog20.org/}
}

@inproceedings{ekr2011-padl,
  abstract = {We present a declarative framework for belief set merging tasks over (possibly heterogeneous) knowledge bases, where belief sets are sets of literals. The framework is designed generically for flexible deployment to a range of applications, and allows to specify complex merging tasks in tree-structured merging plans, whose leaves are the possible belief sets of the knowledge bases that are processed using merging operators.  A prototype is implemented in MELD (MErging Library for Dlvhex) on top of the DLVHEX system for HEX-programs, which are nonmonotonic logic programs with access to external sources. Plans in the task description language allow to formulate different conflict resolution strategies, and by shared object libraries, the user may also develop and integrate her own merging operators.  MELD supports rapid prototyping of merging tasks, providing a computational backbone such that users can focus on operator optimization and evaluation, and on experimenting with merging strategies; this is particularly useful if a best merging operator or strategy is not known. Example applications are combining multiple decision diagrams (e.g., in biomedicine), judgment aggregation in social choice theory, and ontology merging.},
  author = {Christoph Redl and Thomas Eiter and Thomas Krennwallner},
  booktitle = {13th International Symposium on Practical Aspects of Declarative Languages (PADL 2011), Austin, Texas, U.S.A., January 24-25, 2011},
  conference = {http://www.dcc.fc.up.pt/PADL-2011/},
  date = {January 24-25, 2011},
  date-added = {2010-10-11 07:41:09 +0200},
  date-modified = {2011-08-13 09:42:08 +0200},
  doi = {10.1007/978-3-642-18378-2_10},
  editor = {Ricardo Rocha and John Launchbury},
  isbn = {978-3-642-18377-5},
  keywords = {Answer Set Programming, Belief Merging, Hybrid Knowledge Base, HEX-Programs},
  location = {Austin, Texas, U.S.A.},
  month = {January},
  pages = {99--114},
  projectref = {FWF-P20841, WWTF-ICT08-020, Ontorule},
  publisher = {Springer},
  series = {LNCS},
  title = {{Declarative Belief Set Merging using Merging Plans}},
  url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/padl2011-beliefmerging.pdf},
  volume = {6539},
  year = {2011},
  bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2011/padl2011-beliefmerging.pdf},
  bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-642-18378-2_10},
  bdsk-url-3 = {http://www.dcc.fc.up.pt/PADL-2011/}
}