@article {986, title = {Deep Deductive Reasoning is a Hard Deep Learning Problem}, journal = {Neurosymbolic Artificial Intelligence}, year = {In Press}, author = {Pascal Hitzler and Rushrukh Rayan and Joseph Zalewski and Sanaz Saki Norouzi and Aaron Eberhart and Eugene Y. Vasserman} } @proceedings {954, title = {A Case for Extensional Non-Wellfounded Metamodeling}, journal = {LPAR 25}, volume = {18}, year = {2024}, month = {05/2024}, pages = {163--178}, publisher = {EasyChair}, edition = {Kalpa Publications in Computing, LPAR 25 Complementary Volume}, address = {Balaclava, Mauritius}, abstract = {

We introduce a notion of extensional metamodeling that can be used to extend knowl- edge representation languages, and show that this feature does not increase computational complexity of reasoning in many cases. We sketch the relation of our notion to various existing logics with metamodeling and to non-wellfounded sets, and discuss applications. We also comment on the usability of black-box reductions to develop reasoning algorithms for metamodeling.

}, doi = {10.29007/bpwd}, url = {https://easychair.org/publications/paper/K8rh}, author = {Joseph Zalewski and Pascal Hitzler} } @article {969, title = {Deep Deductive Reasoning is a Hard Deep Learning Problem}, year = {2023}, author = {Pascal Hitzler and Rushrukh Rayan and Joseph Zalewski and Sanaz Saki Norouzi and Aaron Eberhart and Eugene Y. Vasserman} } @conference {947, title = {Should I Stay or Should I Go: A New Reasoner for Description Logic}, booktitle = {Knowledge Graphs and Semantic Web {\textendash} 5th Iberoamerican Conference and 4th Indo-American Conference}, year = {2023}, author = {Aaron Eberhart and Joseph Zalewski and Pascal Hitzler} } @article {978, title = {Some Lower Bounds Related to the Missing String Problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-027}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/027}, author = {Joseph Zalewski} } @article {977, title = {Know, Know Where, Knowwheregraph: {A} Densely Connected, Cross-Domain Knowledge Graph and Geo-Enrichment Service Stack for Applications in Environmental Intelligence}, journal = {AI Mag.}, volume = {43}, year = {2022}, pages = {30{\textendash}39}, doi = {10.1609/AIMAG.V43I1.19120}, url = {https://doi.org/10.1609/aimag.v43i1.19120}, author = {Krzysztof Janowicz and Pascal Hitzler and Wenwen Li and Dean Rehberger and Mark Schildhauer and Rui Zhu and Cogan Shimizu and Colby K. Fisher and Ling Cai and Gengchen Mai and Joseph Zalewski and Lu Zhou and Shirly Stephen and Seila Gonzalez Estrecha and Bryce D. Mecum and Anna Lopez-Carr and Andrew Schroeder and Dave Smith and Dawn J. Wright and Sizhe Wang and Yuanyuan Tian and Zilong Liu and Meilin Shi and Anthony D{\textquoteright}Onofrio and Zhining Gu and Kitty Currier} } @article {887, title = {Know, Know Where, KnowWhereGraph: A Densely Connected, Cross-Domain Knowledge Graph and Geo-Enrichment Service Stack for Applications in Environmental Intelligence}, journal = {AI Magazine}, year = {2022}, author = {Krzysztof Janowicz and Pascal Hitzler and Wenwen Li and Dean Rehberger and Mark Schildhauer and Rui Zhu and Cogan Shimizu and Colby K. Fisher and Ling Cai and Gengchen Mai and Joseph Zalewski and Lu Zhou and Shirly Stephen and Seila Gonzalez and Bryce Mecum and Anna Lopez Carr and Andrew Schroeder and Dave Smith and Dawn Wright and Sizhe Wang and Yuanyuan Tian and Zilong Liu and Meilin Shi and Anthony D{\textquoteright}Onofrio and Zhining Gu} } @conference {877, title = {InK Browser - The Interactive Knowledge Browser}, booktitle = {International Semantic Web Conference}, volume = {20}, year = {2021}, abstract = {

We present an improved implementation of the Interactive Knowledge Browser (InK Browser), a tool for exploring knowledge graphs visually, using a schema diagram.

}, author = {Joseph Zalewski and Lu Zhou and Cogan Shimizu and Pascal Hitzler} } @article {864, title = {Semantic Compression with Region Calculi in Nested Hierarchical Grids (Technical Report)}, year = {2021}, abstract = {

We propose the combining of region connection calculi with nested hierarchical grids for representing spatial region data in the context of knowledge graphs, thereby avoiding reliance on vector representations. We present a resulting region calculus, and provide qualitative and formal evidence that this representation can be favorable with large data volumes in the context of knowledge graphs; in particular we study means of efficiently choosing which triples to store to minimize space requirements when data is represented this way, and we provide an algorithm for finding the smallest possible set of triples for this purpose including an asymptotic measure of the size of this set for a special case. We prove that a known constraint calculus is adequate for the reconstruction of all triples describing a region from such a pruned representation, but problematic for reasoning with hierarchical grids in general.

}, keywords = {Hierarchical Grids, Knowledge Graphs, RCC5}, author = {Joseph Zalewski and Pascal Hitzler and Krzysztof Janowicz} }