BibSonomyburst/author/KrennwallnerBibSonomy RSS feed for /author/Krennwallner2012-02-16T10:55:52+01:00http://www.bibsonomy.org/bibtex/2339d735f9aefcb47fc1e5444a0efc10c/dblpdblp2012-02-09T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, <a href="/author/Schindlauer">Roman Schindlauer</a>, and <a href="/author/Ianni">Giovambattista Ianni</a> </span><em>ISAIM, </em>(<em>2008</em>)Thu Feb 09 00:00:00 CET 2012ISAIMconf/isaim/2008Exploiting Conjunctive Queries in Description Logic Programs.2008dblp http://www.bibsonomy.org/bibtex/20ebdec2cd3de0896714ada1fce989644/dblpdblp2012-01-31T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Dao-Tran">Minh Dao-Tran</a>, <a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Fink">Michael Fink</a>, and <a href="/author/Krennwallner">Thomas Krennwallner</a> </span><em>Datalog, </em><em>volume 6702 of Lecture Notes in Computer Science, </em><em>page 59-77. </em><em>Springer, </em>(<em>2010</em>)Tue Jan 31 00:00:00 CET 2012Datalogconf/datalog/201059-77Lecture Notes in Computer ScienceFirst-Order Encodings for Modular Nonmonotonic Datalog Programs.67022010dblp http://www.bibsonomy.org/bibtex/288bbe7aa0b59340181e4daddb82b65eb/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, and <a href="/author/Redl">Christoph Redl</a> </span><em>CoRR</em> (<em>2011</em>)Mon Dec 05 00:00:00 CET 2011CoRRNested HEX-Programsabs/1108.56262011dblp http://www.bibsonomy.org/bibtex/26ef06049cafd8182b884354732e84512/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Drescher">Christian Drescher</a>, <a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Fink">Michael Fink</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, and <a href="/author/Walsh">Toby Walsh</a> </span><em>CoRR</em> (<em>2011</em>)Mon Dec 05 00:00:00 CET 2011CoRRSymmetry Breaking for Distributed Multi-Context Systemsabs/1104.39312011dblp http://www.bibsonomy.org/bibtex/2988d4a6941aea8690cbf1dcabdfb6a83/reynares.ereynares.e2011-08-09T16:33:51+02:00ai knowledge ontology paper processing rules semantic springer v1002 web <span class="authorEditorList"><a href="/author/Drabent">Wlodzimierz Drabent</a>, <a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Ianni">Giovambattista Ianni</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, <a href="/author/Lukasiewicz">Thomas Lukasiewicz</a>, and <a href="/author/Maluszynski">Jan Maluszynski</a> </span><em>Semantic Techniques for the Web: The REWERSE Perspective, </em><em>chapter 1, </em>(<em>2009</em>)Tue Aug 09 16:33:51 CEST 2011Semantic Techniques for the Web: The {REWERSE} Perspective1BryMaluszynski20091-49Hybrid Reasoning with Rules and Ontologies 2009ai knowledge ontology paper processing rules semantic springer v1002 web The purpose of this chapter is to report on work that has been done in the REWERSE project concerning hybrid reasoning with rules and ontologies. Two major 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.http://www.bibsonomy.org/bibtex/2f61cf449c1b51a1b6278b404e6b76578/dblpdblp2011-07-11T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Krennwallner">Thomas Krennwallner</a> </span><em>ICLP Technical Communications, </em><em>volume 11 of LIPIcs, </em><em>page 274-279. </em><em>Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, </em>(<em>2011</em>)Mon Jul 11 00:00:00 CEST 2011ICLP (Technical Communications)conf/iclp/2011274-279LIPIcsPromoting Modular Nonmonotonic Logic Programs.112011dblp http://www.bibsonomy.org/bibtex/23f0a3f27e9beed601d9d0e09a351141a/dblpdblp2011-05-02T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Fink">Michael Fink</a>, <a href="/author/Ianni">Giovambattista Ianni</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, and <a href="/author/Schüller">Peter Schüller</a> </span><em>LPNMR, </em><em>volume 6645 of Lecture Notes in Computer Science, </em><em>page 93-106. </em><em>Springer, </em>(<em>2011</em>)Mon May 02 00:00:00 CEST 2011LPNMRconf/lpnmr/201193-106Lecture Notes in Computer SciencePushing Efficient Evaluation of HEX Programs by Modular Decomposition.66452011dblp http://www.bibsonomy.org/bibtex/2bfacc27b4bf03cab1f846afaf0b5e87f/dblpdblp2011-05-02T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Drescher">Christian Drescher</a>, <a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Fink">Michael Fink</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, and <a href="/author/Walsh">Toby Walsh</a> </span><em>LPNMR, </em><em>volume 6645 of Lecture Notes in Computer Science, </em><em>page 26-39. </em><em>Springer, </em>(<em>2011</em>)Mon May 02 00:00:00 CEST 2011LPNMRconf/lpnmr/201126-39Lecture Notes in Computer ScienceSymmetry Breaking for Distributed Multi-Context Systems.66452011dblp http://www.bibsonomy.org/bibtex/2e3812a280d1479bce96b8688ec7a6799/dblpdblp2011-02-15T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Redl">Christoph Redl</a>, <a href="/author/Eiter">Thomas Eiter</a>, and <a href="/author/Krennwallner">Thomas Krennwallner</a> </span><em>PADL, </em><em>volume 6539 of Lecture Notes in Computer Science, </em><em>page 99-114. </em><em>Springer, </em>(<em>2011</em>)Tue Feb 15 00:00:00 CET 2011PADLconf/padl/201199-114Lecture Notes in Computer ScienceDeclarative Belief Set Merging Using Merging Plans.65392011dblp http://www.bibsonomy.org/bibtex/2b4a8ee81fe0669c5f76a3218aa68bc7f/flint63flint632010-10-31T22:39:10+01:00ai knowledge springer v1010 paper processing semantic web ontology rules <span class="authorEditorList"><a href="/author/Drabent">Wlodzimierz Drabent</a>, <a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Ianni">Giovambattista Ianni</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, <a href="/author/Lukasiewicz">Thomas Lukasiewicz</a>, and <a href="/author/Maluszynski">Jan Maluszynski</a> </span><em>Semantic Techniques for the Web: The REWERSE Perspective, </em><em>chapter 1, </em>(<em>2009</em>)Sun Oct 31 22:39:10 CET 2010Semantic Techniques for the Web: The REWERSE Perspective1BryMaluszynski20091-49Hybrid Reasoning with Rules and Ontologies2009ai knowledge springer v1010 paper processing semantic web ontology rules The purpose of this chapter is to report on work that has been done in the REWERSE project concerning hybrid reasoning with rules and ontologies. Two major 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.http://www.bibsonomy.org/bibtex/2a3d3abed471cb41ae5ead185420e0140/flint63flint632010-10-31T09:37:52+01:00zzz.th.c46 ai springer v1010 paper rdf semantic retrieval web ontology database rules <span class="authorEditorList"><a href="/author/Ianni">Giovambattista Ianni</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, <a href="/author/Martello">Alessandra Martello</a>, and <a href="/author/Polleres">Axel Polleres</a> </span><em>The Semantic Web -- ISWC 2009: 8th International Semantic Web Conference, Chantilly, VA, USA, </em>(<em>2009</em>)Sun Oct 31 09:37:52 CET 2010The Semantic Web -- ISWC 2009: 8th International Semantic Web Conference, Chantilly, VA, USAISWC2009310-327Dynamic Querying of Mass-Storage {RDF} Data with Rule-Based Entailment Regimes2009zzz.th.c46 ai springer v1010 paper rdf semantic retrieval web ontology database rules 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.http://www.bibsonomy.org/bibtex/23cc68e9374c41420d6dce5e28082d8bb/dblpdblp2010-09-21T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Bairakdar">Seif El-Din Bairakdar</a>, <a href="/author/Dao-Tran">Minh Dao-Tran</a>, <a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Fink">Michael Fink</a>, and <a href="/author/Krennwallner">Thomas Krennwallner</a> </span><em>JELIA, </em><em>volume 6341 of Lecture Notes in Computer Science, </em><em>page 352-355. </em><em>Springer, </em>(<em>2010</em>)Tue Sep 21 00:00:00 CEST 2010JELIAconf/jelia/2010352-355Lecture Notes in Computer ScienceThe DMCS Solver for Distributed Nonmonotonic Multi-Context Systems.63412010dblp http://www.bibsonomy.org/bibtex/2edcf73d70c92692c4ed4633cc720478e/dblpdblp2010-09-21T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Bairakdar">Seif El-Din Bairakdar</a>, <a href="/author/Dao-Tran">Minh Dao-Tran</a>, <a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Fink">Michael Fink</a>, and <a href="/author/Krennwallner">Thomas Krennwallner</a> </span><em>JELIA, </em><em>volume 6341 of Lecture Notes in Computer Science, </em><em>page 24-37. </em><em>Springer, </em>(<em>2010</em>)Tue Sep 21 00:00:00 CEST 2010JELIAconf/jelia/201024-37Lecture Notes in Computer ScienceDecomposition of Distributed Nonmonotonic Multi-Context Systems.63412010dblp http://www.bibsonomy.org/bibtex/22bfaf3744e957a2e95507bcf91454c57/dblpdblp2010-07-21T16:01:11+02:00dblp <span class="authorEditorList"><a href="/author/Dao-Tran">Minh Dao-Tran</a>, <a href="/author/Eiter">Thomas Eiter</a>, <a href="/author/Fink">Michael Fink</a>, and <a href="/author/Krennwallner">Thomas Krennwallner</a> </span><em>KR, </em><em>AAAI Press, </em>(<em>2010</em>)Wed Jul 21 16:01:11 CEST 2010KRconf/kr/2010Distributed Nonmonotonic Multi-Context Systems.2010dblp http://www.bibsonomy.org/bibtex/2c10a5701aedf15144f92df3c412746b0/ontoruleontorule2010-03-29T16:58:04+02:00hybrid ontologies ontorule reasoning rules <span class="authorEditorList"><a href="/author/Drabent">W. Drabent</a>, <a href="/author/Eiter">T. Eiter</a>, <a href="/author/Ianni">G. Ianni</a>, <a href="/author/Krennwallner">T. Krennwallner</a>, <a href="/author/Lukasiewicz">T. Lukasiewicz</a>, and <a href="/author/Maluszynski.">J. Maluszynski.</a> </span><em>Semantic Techniques for the Web</em> (<em>July 2009</em>)Mon Mar 29 16:58:04 CEST 2010Semantic Techniques for the WebJuly55001-49Hybrid reasoning with rules and ontologies2009hybrid ontologies ontorule reasoning rules http://www.bibsonomy.org/bibtex/2c8e09bdc4ac170e37b41116ff0622b02/ontoruleontorule2010-03-29T16:54:10+02:00ontorule <span class="authorEditorList"><a href="/author/Dao-Tran">Minh Dao-Tran</a>, <a href="/author/Eiter">Thomas Eiter</a>, and <a href="/author/Krennwallner">Thomas Krennwallner</a> </span><em>Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty ECSQARU 2009, Verona, Italy, July 1--3, 2009, </em><em>page 602-613. </em><em>Springer, </em>(<em>2009</em>)<em>Forthcoming . </em>Mon Mar 29 16:54:10 CEST 2010{Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2009), Verona, Italy, July 1--3, 2009}Forthcoming602-613LNCS{Realizing Default Logic over Description Logic Knowledge Bases}2009ontorule http://www.bibsonomy.org/bibtex/2478b6b15e7e209bd9fafb3d97d112e50/ontoruleontorule2010-03-29T16:48:42+02:00ontorule <span class="authorEditorList"><a href="/author/Eiter">T. Eiter</a>, <a href="/author/Fink">M. Fink</a>, and <a href="/author/Krennwallner">T. Krennwallner</a> </span><em>Proceedings of the 21st International Joint Conference on Artificial Intelligence. AAAI Press/IJCAI, 2009.</em> (<em>2009</em>)Mon Mar 29 16:48:42 CEST 2010Proceedings of the 21st International Joint Conference on Artificial Intelligence. AAAI Press/IJCAI, 2009.752-758Decomposition of declarative knowledge bases with external functions2009ontorule http://www.bibsonomy.org/bibtex/2fee2b1bba9d16bbf374f3aa462db21e5/dblpdblp2009-11-11T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Ianni">Giovambattista Ianni</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, <a href="/author/Martello">Alessandra Martello</a>, and <a href="/author/Polleres">Axel Polleres</a> </span><em>International Semantic Web Conference, </em><em>volume 5823 of Lecture Notes in Computer Science, </em><em>page 310-327. </em><em>Springer, </em>(<em>2009</em>)Wed Nov 11 00:00:00 CET 2009International Semantic Web Conferenceconf/semweb/2009310-327Lecture Notes in Computer ScienceDynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes.58232009dblp dblphttp://www.bibsonomy.org/bibtex/21006e7ff526a40a5bb05978af90ae3e7/ivan_hermanivan_herman2009-11-03T13:41:58+01:00rdf rdfs rules semanticweb sparql <span class="authorEditorList"><a href="/author/Ianni">Giovambattista Ianni</a>, <a href="/author/Krennwallner">Thomas Krennwallner</a>, <a href="/author/Martello">Alessandra Martello</a>, and <a href="/author/Polleres">Axel Polleres</a> </span><em>The Semantic Web - ISWC 2009, </em><em>volume 5823 of Lecture Notes in Computer Science, </em><em>page 310--327. </em><em>Springer, </em>(<em>2009</em>)Tue Nov 03 13:41:58 CET 2009The Semantic Web - ISWC 2009310--327Lecture Notes in Computer ScienceDynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes58232009rdf rdfs rules semanticweb sparql 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.http://www.bibsonomy.org/bibtex/2c41ab3bdcfef592382aac220301403bb/stijn.heymansstijn.heymans2009-10-22T15:47:30+02:00ontorule <span class="authorEditorList"><a href="/author/DAO Tran">Minh DAO Tran</a>, <a href="/author/Eiter">Thomas Eiter</a>, and <a href="/author/Krennwallner">Thomas Krennwallner</a> </span><em>Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty ECSQARU 2009, Verona, Italy, July 1--3, 2009, </em><em>Springer, </em>(<em>2009</em>)<em>Forthcoming . </em>Thu Oct 22 15:47:30 CEST 2009{Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2009), Verona, Italy, July 1--3, 2009}ForthcomingLNCS{Realizing Default Logic over Description Logic Knowledge Bases}2009ontorule