Table of Contents

• Planning Problems for Graph Structured Data in Description LogicsShqiponja Ahmetaj, Diego Calvanese, Magdalena Ortiz, Mantas Simkus. 4-7 [doi]
• SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS EntailmentAlbin Ahmeti, Diego Calvanese, Axel Polleres. 8-20 [doi]
• Temporal OBDA with LTL and DL-LiteAlessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev. 21-32 [doi]
• Matching with Respect to General Concept Inclusions in the Description Logic ELFranz Baader, Barbara Morawska. 33-44 [doi]
• Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like QueriesMeghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii. 45-57 [doi]
• Fuzzy DLs over Finite Lattices with NominalsStefan Borgwardt. 58-70 [doi]
• Gödel FL_0 with Greatest Fixed-Point SemanticsStefan Borgwardt, José A. Leyva Galano, Rafael Peñaloza. 71-82 [doi]
• Query Inseparability by GamesElena Botoeva, Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev. 83-95 [doi]
• Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair SemanticsCamille Bourgaux, Meghyn Bienvenu, François Goasdoué. 96-99 [doi]
• Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLsPierre Bourhis, Michael Morak, Andreas Pieris. 100-111 [doi]
• Contextualized Knowledge Repositories with Justifiable ExceptionsLoris Bozzato, Thomas Eiter, Luciano Serafini. 112-123 [doi]
• Shape and Content: Incorporating Domain Knowledge into Shape AnalysisDiego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger. 124-127 [doi]
• Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLsDavid Carral, Cristina Feier, Ana Armas Romero, Bernardo Cuenca Grau, Pascal Hitzler, Ian Horrocks. 128-140 [doi]
• Controlled Query Evaluation over Lightweight OntologiesBernardo Cuenca Grau, Evgeny Kharlamov, Egor V. Kostylev, Dmitriy Zheleznyakov. 141-152 [doi]
• On Faceted Search over Knowledge BasesBernardo Cuenca Grau, Evgeny Kharlamov, Dmitriy Zheleznyakov, Marcelo Arenas, Sarunas Marciuska. 153-156 [doi]
• DeaLing with Ontologies using CODsChiara Del Vescovo, Rafael Peñaloza. 157-168 [doi]
• Towards Practical Deletion Repair of Inconsistent DL-programsThomas Eiter, Michael Fink, Daria Stepanova 0001. 169-180 [doi]
• Lower and Upper Approximations for Depleting Modules of Description Logic OntologiesWilliam Gatens, Boris Konev, Frank Wolter. 181-184 [doi]
• Abstraction Refinement for Ontology MaterializationBirte Glimm, Yevgeny Kazakov, Thorsten Liebig, Trung-Kien Tran, Vincent Vialard. 185-196 [doi]
• Query Rewriting under EL TBoxes: Efficient AlgorithmsPeter Hansen, Carsten Lutz, Inanç Seylan, Frank Wolter. 197-208 [doi]
• Datalog Rewriting Techniques for Non-Horn OntologiesMark Kaminski, Yavor Nenov, Bernardo Cuenca Grau. 209-220 [doi]
• Goal-Directed Tracing of Inferences in EL OntologiesYevgeny Kazakov, Pavel Klinov. 221-232 [doi]
• Complexity of Temporal Query Abduction in DL-LiteSzymon Klarman, Thomas Meyer. 233-244 [doi]
• Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxesPatrick Koopmann, Renate A. Schmidt. 245-257 [doi]
• XPath for DL-Lite OntologiesEgor V. Kostylev, Juan L. Reutter, Domagoj Vrgoc. 258-269 [doi]
• Complexities of Nominal SchemasMarkus Krötzsch, Sebastian Rudolph. 270-273 [doi]
• Brave and Cautious Reasoning in ELMichel Ludwig, Rafael Peñaloza. 274-286 [doi]
• Detecting Conjunctive Query Differences between ELHr-Terminologies using HypergraphsMichel Ludwig, Dirk Walther 0002. 287-298 [doi]
• Axiom Dependency Hypergraphs for Fast Atomic Decomposition of OntologiesFrancisco Martín-Recuerda, Dirk Walther. 299-310 [doi]
• Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF SystemsBoris Motik, Yavor Nenov, Robert Piro, Ian Horrocks, Dan Olteanu. 311-323 [doi]
• Optimised Absorption for Expressive Description LogicsAndreas Steigmiller, Birte Glimm, Thorsten Liebig. 324-335 [doi]
• Hybrid Query Answering Over DL OntologiesGiorgos Stoilos, Giorgos B. Stamou. 336-339 [doi]
• Pushing the CFDnc EnvelopeDavid Toman, Grant E. Weddell. 340-351 [doi]
• Pay-as-you-go Ontology Query Answering Using a Datalog ReasonerYujiao Zhou, Yavor Nenov, Bernardo Cuenca Grau, Ian Horrocks. 352-364 [doi]
• Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?Tahani Alsubait, Bijan Parsia, Uli Sattler. 365-377 [doi]
• A MILP-based Decision Procedure for the (Fuzzy) Description Logic ALCBFernando Bobillo, Umberto Straccia. 378-390 [doi]
• Gödel Description Logics with General ModelsStefan Borgwardt, Felix Distel, Rafael Peñaloza. 391-403 [doi]
• How to Best Nest Regular Path QueriesPierre Bourhis, Markus Krötzsch, Sebastian Rudolph. 404-415 [doi]
• Expressive Identification Constraints to Capture Functional Dependencies in Description LogicsDiego Calvanese, Wolfgang Fischl, Reinhard Pichler, Emanuel Sallinger, Mantas Simkus. 416-420 [doi]
• Complexity Sources in Fuzzy Description LogicMarco Cerami, Umberto Straccia. 421-433 [doi]
• Obfuscation of Semantic Data: Restricting the Spread of Sensitive InformationFederico Cerutti, Geeth de Mel, Timothy J. Norman, Nir Oren, Artemis Parvizi, Paul Sullivan, Alice Toniolo. 434-446 [doi]
• Bayesian Description LogicsIsmail Ilkan Ceylan, Rafael Peñaloza. 447-458 [doi]
• An ABox Revision Algorithm for the Description Logic EL_botLiang Chang, Uli Sattler, Tianlong Gu. 459-470 [doi]
• Evaluation of Extraction Techniques for Ontology ExcerptsJieying Chen, Michel Ludwig, Yue Ma, Dirk Walther 0002. 471-482 [doi]
• Graphol: Ontology Representation through DiagramsMarco Console, Domenico Lembo, Valerio Santarelli, Domenico Fabio Savo. 483-495 [doi]
• Reducing Global Consistency to Local Consistency in Ontology-based Data Access - Extended AbstractMarco Console, Maurizio Lenzerini. 496-499 [doi]
• Comparing the Expressiveness of Description LogicsAli Rezaei Divroodi. 500-512 [doi]
• Reasoning about Belief Uncertainty in DL Lite N boolAla Djeddai, Hassina Seridi, Tarek Khadir. 513-525 [doi]
• Mary, What's Like All Cats?Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan. 526-529 [doi]
• Generating Comprehensible Explanations in Description LogicFredrik Engström, Abdul Rahim Nizamani, Claes Strannegård. 530-542 [doi]
• Rational Closure in SHIQLaura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato. 543-555 [doi]
• TBox Abduction in ALC Using a DL TableauKen Halland, Arina Britz, Szymon Klarman. 556-566 [doi]
• Typed Higher-Order Variant of SROIQ - Why Not?Martin Homola, Jan Kluka, Vojtech Svátek, Miroslav Vacura. 567-578 [doi]
• Bridging the Gap between Tableau and Consequence-Based ReasoningYevgeny Kazakov, Pavel Klinov. 579-590 [doi]
• Towards a Description Logic for Program Analysis: Extending ALCQIO with ReachabilityTomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger. 591-594 [doi]
• Visualization and Management of Mappings in Ontology-based Data Access (Progress Report)Domenico Lembo, Riccardo Rosati, Marco Ruzzi, Domenico Fabio Savo, Emanuele Tocci. 595-607 [doi]
• Practical Query Answering over Hi (DL-LiteR) Knowledge BasesMaurizio Lenzerini, Lorenzo Lepore, Antonella Poggi. 608-619 [doi]
• Temporalising EL Concepts with Time IntervalsJared Leo, Ulrike Sattler, Bijan Parsia. 620-632 [doi]
• Towards Parallel Repair: An Ontology Decomposition-based ApproachYue Ma, Rafael Peñaloza. 633-645 [doi]
• A Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement TraceabilityYuri Malheiros, Fred Freitas. 646-658 [doi]
• An Empirical Investigation of Difficulty of Subsets of Description Logic OntologiesNicolas Matentzoglu, Bijan Parsia, Uli Sattler. 659-670 [doi]
• DIP: A Defeasible-Inference Platform for OWL OntologiesKodylan Moodley, Thomas Meyer, Uli Sattler. 671-683 [doi]
• Transition Constraints for Temporal AttributesE. A. Nasubo Ongoma, C. Maria Keet, Thomas Meyer. 684-695 [doi]
• A Stream-Temporal Query Language for Ontology Based Data AccessÖzgür Lütfü Özçep, Ralf Möller, Christian Neuenstadt. 696-708 [doi]
• Certain Answers in a Rough WorldRafael Peñaloza, Veronika Thost, Anni-Yasmin Turhan. 709-712 [doi]
• Predicting OWL Reasoners: Locally or Globally?Viachaslau Sazonau, Uli Sattler, Gavin Brown. 713-724 [doi]
• OptiqueVQS: Visual Query Formulation for OBDAAhmet Soylu, Evgeny Kharlamov, Dmitriy Zheleznyakov, Ernesto Jiménez-Ruiz, Martin Giese, Ian Horrocks. 725-728 [doi]
• OBDA Using RL Reasoners and RepairingGiorgos Stoilos. 729-733 [doi]
• Instance-driven TBox Revision in DL-LiteZhe Wang, Kewen Wang, Guilin Qi, Zhiqiang Zhuang, Yuefeng Li. 734-745 [doi]
• Rational Elimination of DL-Lite TBox AxiomsZhiqiang Zhuang, Zhe Wang, Kewen Wang, Grigoris Antoniou. 746-756 [doi]