@conference {981, title = {Traditional Bengali Food Classification Using Convolutional Neural Network}, booktitle = {2021 IEEE Region 10 Symposium (TENSYMP)}, year = {2021}, pages = {1-8}, keywords = {Computational modeling, Convolutional Neural Network, Convolutional neural networks, Data models, fine tuning, image classification, Image recognition, Neural networks, traditional Bengali foods, Transfer learning, Turning, VGG16}, doi = {10.1109/TENSYMP52854.2021.9550874}, author = {Uddin, Asif Mahbub and Al Miraj, Abdullah and Sen Sarma, Moumita and Das, Avishek and Gani, Md. Manjurul} } @conference {135, title = {EL-ifying Ontologies}, booktitle = {Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 19-22, 2014. Proceedings}, year = {2014}, pages = {464{\textendash}479}, abstract = {

The OWL 2 profiles are fragments of the ontology language OWL 2 for which standard reasoning tasks are feasible in polynomial time. Many OWL ontologies, however, contain a typically small number of out-of-profile axioms, which may have little or no influence on reasoning outcomes. We investigate techniques for rewriting axioms into the EL and RL profiles of OWL 2. We have tested our techniques on both classification and data reasoning tasks with encouraging results.

}, keywords = {description logics, OWL, Rewriting, Tractable Reasoning}, doi = {10.1007/978-3-319-08587-6_36}, url = {http://dx.doi.org/10.1007/978-3-319-08587-6_36}, author = {David Carral and Cristina Feier and Cuenca Grau, Bernardo and Pascal Hitzler and Ian Horrocks} } @conference {131, title = {Pushing the Boundaries of Tractable Ontology Reasoning}, booktitle = {The Semantic Web - ISWC 2014 - 13th International Semantic Web Conference, Riva del Garda, Italy, October 19-23, 2014. Proceedings, Part II}, year = {2014}, pages = {148{\textendash}163}, abstract = {

We identify a class of Horn ontologies for which standard reasoning tasks such as instance checking and classification are tractable. The class is general enough to include the OWL 2 EL, QL, and RL profiles. Verifying whether a Horn ontology belongs to the class can be done in polynomial time. We show empirically that the class includes many real-world ontologies that are not included in any OWL 2 profile, and thus that polynomial time reasoning is possible for these ontologies.

}, keywords = {description logics, OWL, Tractable Reasoning}, doi = {10.1007/978-3-319-11915-1_10}, url = {http://dx.doi.org/10.1007/978-3-319-11915-1_10}, author = {David Carral and Cristina Feier and Cuenca Grau, Bernardo and Pascal Hitzler and Ian Horrocks} } @conference {134, title = {Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs}, booktitle = {Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014.}, year = {2014}, pages = {128{\textendash}140}, abstract = {

We investigate cases where an ontology expressed in a seemingly hard DL can be polynomially reduced to one in a simpler logic, while preserving reasoning outcomes for classification and fact entailment. Our transformations target the elimination of inverse roles, universal and existential restrictions, and in the best case allow us to rewrite the given ontology into one of the OWL 2 profiles. Even if an ontology cannot be fully rewritten into a profile, in many cases our transformations allow us to exploit further optimisation techniques. Moreover, the elimination of some out-of-profile axioms can improve the performance of modular reasoners, such as MORe. We have tested our techniques on both classification and data reasoning tasks with encouraging results.

}, keywords = {description logics, OWL, Tractable Reasoning}, url = {http://ceur-ws.org/Vol-1193/paper_75.pdf}, author = {David Carral and Cristina Feier and Ana Armas Romero and Cuenca Grau, Bernardo and Pascal Hitzler and Ian Horrocks} } @conference {130, title = {A Geo-ontology Design Pattern for Semantic Trajectories}, booktitle = {Spatial Information Theory - 11th International Conference, COSIT 2013, Scarborough, UK, September 2-6, 2013. Proceedings}, year = {2013}, pages = {438{\textendash}456}, abstract = {

Trajectory data have been used in a variety of studies, including human behavior analysis, transportation management, and wildlife tracking. While each study area introduces a different perspective, they share the need to integrate positioning data with domain-specific information. Semantic annotations are necessary to improve discovery, reuse, and integration of trajectory data from different sources. Consequently, it would be beneficial if the common structure encountered in trajectory data could be annotated based on a shared vocabulary, abstracting from domain-specific aspects. Ontology design patterns are an increasingly popular approach to define such flexible and self-contained building blocks of annotations. They appear more suitable for the annotation of interdisciplinary, multi-thematic, and multi-perspective data than the use of foundational and domain ontologies alone. In this paper, we introduce such an ontology design pattern for semantic trajectories. It was developed as a community effort across multiple disciplines and in a data-driven fashion. We discuss the formalization of the pattern using the Web Ontology Language (OWL) and apply the pattern to two different scenarios, personal travel and wildlife monitoring.

}, keywords = {Ontology Design Pattern, OWL, Trajectory}, doi = {10.1007/978-3-319-01790-7_24}, url = {http://dx.doi.org/10.1007/978-3-319-01790-7_24}, author = {Yingjie Hu and Krzysztof Janowicz and David Carral and Simon Scheider and Werner Kuhn and Gary Berg-Cross and Pascal Hitzler and Mike Dean and Dave Kolas} } @article {65, title = {Type-Elimination-Based Reasoning for the Description Logic SHIQbs using Decision Diagrams and Disjunctive Datalog}, journal = {Logical Methods in Computer Science}, volume = {8}, year = {2012}, abstract = {We propose a novel, type-elimination-based method for standard reasoning in the description logic SHIQbs extended by DL-safe rules. To this end, we first establish a knowledge compilation method converting the terminological part of an ALCIb knowledge base into an ordered binary decision diagram (OBDD) that represents a canonical model. This OBDD can in turn be transformed into disjunctive Datalog and merged with the assertional part of the knowledge base in order to perform combined reasoning. In order to leverage our technique for full SHIQbs, we provide a stepwise reduction from SHIQbs to ALCIb that preserves satisfiability and entailment of positive and negative ground facts. The proposed technique is shown to be worst-case optimal w.r.t. combined and data complexity.}, keywords = {datalog, decision diagrams, description logics, type elimination}, doi = {10.2168/LMCS-8(1:12)2012}, url = {http://dx.doi.org/10.2168/LMCS-8(1:12)2012}, author = {Sebastian Rudolph and Markus Kr{\"o}tzsch and Pascal Hitzler} } @conference {139, title = {A Better Uncle for {OWL}: Nominal Schemas for Integrating Rules and Ontologies}, booktitle = {Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011}, year = {2011}, month = {03/2011}, pages = {645-654}, publisher = {ACM}, organization = {ACM}, abstract = {We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like "variable nominal classes" within axioms. This feature allows ontology languages to express arbitrary DL-safe rules (as expressible in SWRL or RIF) in their native syntax. We show that adding nominal schemas to OWL 2 does not increase the worst-case reasoning complexity, and we identify a novel tractable language SROELV3(\cap, x) that is versatile enough to capture the lightweight languages OWL EL and OWL RL.}, keywords = {datalog, Description Logic, Semantic Web Rule Language, SROIQ, tractability, Web Ontology Language}, isbn = {978-1-4503-0632-4}, doi = {10.1145/1963405.1963496}, url = {http://doi.acm.org/10.1145/1963405.1963496}, author = {Markus Kr{\"o}tzsch and Frederick Maier and Adila Krisnadhi and Pascal Hitzler}, editor = {Sadagopan Srinivasan and Krithi Ramamritham and Arun Kumar and M. P. Ravindra and Elisa Bertino and Ravi Kumar} } @article {82, title = {Generalized Distance Functions in the Theory of Computation}, journal = {Computer Journal}, volume = {53}, year = {2010}, pages = {443{\textendash}464}, abstract = {

We discuss a number of distance functions encountered in the theory of computation, including metrics, ultra-metrics, quasi-metrics, generalized ultra-metrics, partial metrics, d-ultra-metrics and generalized metrics. We consider their properties, associated fixed-point theorems and some general applications they have within the theory of computation. We consider in detail the applications of generalized distance functions in giving a uniform treatment of several important semantics for logic programs, including acceptable programs and natural generalizations of them, and also the supported model and the stable model in the context of locally stratified extended disjunctive logic programs and databases.

}, keywords = {denotational semantics, fixed-point theorems, generalized distance functions, Logic Programming, stable model, supported model, topology, ultra-metrics}, doi = {10.1093/comjnl/bxm108}, url = {http://dx.doi.org/10.1093/comjnl/bxm108}, author = {Anthony K. Seda and Pascal Hitzler} }