Are Quantified Boolean Formulas Hard for Reason-Able Embeddings?
| dc.contributor.author | Potoniec, Jędrzej | |
| dc.date.accessioned | 2023-09-25T06:19:50Z | |
| dc.date.available | 2023-09-25T06:19:50Z | |
| dc.date.issued | 2023 | |
| dc.description.abstract | We aim to establish theoretical boundaries for the applicability of reason-able embeddings, a recently proposed method employing a transferable neural reasoner to shape a latent space of knowledge graph embeddings. Since reason-able embeddings rely on the ALC description logic, we construct a dataset of the hardest concepts in ALC by translating quantified boolean formulas (QBF) from QBFLIB, a benchmark for QBF solvers. We experimentally show the dataset is hard for a symbolic reasoner FaCT++, and analyze the results of reasoning with reason-able embeddings, concluding that the dataset is too hard for them. | en_EN |
| dc.identifier.citation | Potoniec J., Are Quantified Boolean Formulas Hard for Reason-Able Embeddings?. W: Progress in Polish Artificial Intelligence Research 4, Wojciechowski A. (Ed.), Lipiński P. (Ed.)., Seria: Monografie Politechniki Łódzkiej Nr. 2437, Wydawnictwo Politechniki Łódzkiej, Łódź 2023, s. 343-348, ISBN 978-83-66741-92-8, doi: 10.34658/9788366741928.54. | |
| dc.identifier.doi | 10.34658/9788366741928.54 | |
| dc.identifier.isbn | 978-83-66741-92-8 | |
| dc.identifier.uri | http://hdl.handle.net/11652/4830 | |
| dc.identifier.uri | https://doi.org/10.34658/9788366741928.54 | |
| dc.language.iso | en | en_EN |
| dc.page.number | s. 343-348 | |
| dc.publisher | Wydawnictwo Politechniki Łódzkiej | pl_PL |
| dc.publisher | Lodz University of Technology Press | en_EN |
| dc.relation.ispartof | Wojciechowski A. (Ed.), Lipiński P. (Ed.)., Progress in Polish Artificial Intelligence Research 4, Seria: Monografie Politechniki Łódzkiej Nr. 2437, Wydawnictwo Politechniki Łódzkiej, Łódź 2023, ISBN 978-83-66741-92-8, doi: 10.34658/9788366741928. | |
| dc.rights | Dla wszystkich w zakresie dozwolonego użytku | pl_PL |
| dc.rights | Fair use condition | en_EN |
| dc.rights.license | Licencja PŁ | pl_PL |
| dc.rights.license | LUT License | en_EN |
| dc.subject | artificial intelligence | en_EN |
| dc.subject | neural-symbolic reasoning | en_EN |
| dc.subject | knowledge representation | en_EN |
| dc.subject | description logics | en_EN |
| dc.subject | sztuczna inteligencja | pl_PL |
| dc.subject | wnioskowanie neuronalno-symboliczne | pl_PL |
| dc.subject | reprezentacja wiedzy | pl_PL |
| dc.subject | logika opisowa | pl_PL |
| dc.title | Are Quantified Boolean Formulas Hard for Reason-Able Embeddings? | en_EN |
| dc.type | Rozdział - monografia | pl_PL |
| dc.type | Chapter - monograph | en_EN |