Interactive Query Answering on Knowledge Graphs with Soft Entity Constraints
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911708906258432 |
|---|---|
| author | Daza, Daniel Bernardi, Alberto Costabello, Luca Gueret, Christophe Mansoury, Masoud Cochez, Michael Schut, Martijn |
| author_facet | Daza, Daniel Bernardi, Alberto Costabello, Luca Gueret, Christophe Mansoury, Masoud Cochez, Michael Schut, Martijn |
| contents | Methods for query answering over incomplete knowledge graphs retrieve entities that are likely to be answers, which is particularly useful when such answers cannot be reached by direct graph traversal due to missing edges. However, existing approaches have focused on queries formalized using first-order-logic. In practice, many real-world queries involve constraints that are inherently vague or context-dependent, such as preferences for attributes or related categories. Addressing this gap, we introduce the problem of query answering with soft constraints. We formalize the problem and introduce two efficient methods designed to adjust query answer scores by incorporating soft constraints without disrupting the original answers to a query. These methods are lightweight, requiring tuning only two parameters or a small neural network trained to capture soft constraints while maintaining the original ranking structure. To evaluate the task, we extend existing QA benchmarks by generating datasets with soft constraints. Our experiments demonstrate that our methods can capture soft constraints while maintaining robust query answering performance and adding very little overhead. With our work, we explore a new and flexible way to interact with graph databases that allows users to specify their preferences by providing examples interactively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_13663 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Interactive Query Answering on Knowledge Graphs with Soft Entity Constraints Daza, Daniel Bernardi, Alberto Costabello, Luca Gueret, Christophe Mansoury, Masoud Cochez, Michael Schut, Martijn Artificial Intelligence Machine Learning Methods for query answering over incomplete knowledge graphs retrieve entities that are likely to be answers, which is particularly useful when such answers cannot be reached by direct graph traversal due to missing edges. However, existing approaches have focused on queries formalized using first-order-logic. In practice, many real-world queries involve constraints that are inherently vague or context-dependent, such as preferences for attributes or related categories. Addressing this gap, we introduce the problem of query answering with soft constraints. We formalize the problem and introduce two efficient methods designed to adjust query answer scores by incorporating soft constraints without disrupting the original answers to a query. These methods are lightweight, requiring tuning only two parameters or a small neural network trained to capture soft constraints while maintaining the original ranking structure. To evaluate the task, we extend existing QA benchmarks by generating datasets with soft constraints. Our experiments demonstrate that our methods can capture soft constraints while maintaining robust query answering performance and adding very little overhead. With our work, we explore a new and flexible way to interact with graph databases that allows users to specify their preferences by providing examples interactively. |
| title | Interactive Query Answering on Knowledge Graphs with Soft Entity Constraints |
| topic | Artificial Intelligence Machine Learning |
| url | https://arxiv.org/abs/2508.13663 |