TL;DR
Knowledge graph query systems struggle with vague, context-dependent user preferences that cannot be expressed in formal logic. Daza et al. introduced soft constraints—flexible preference specifications—and developed two lightweight methods to adjust query rankings by incorporating these constraints without disrupting original answers.
✦ Why It Matters
Engineers can now build graph database interfaces that learn user preferences from examples without rigid formal specifications.
Key Takeaways
How It Works
The proposed methods adjust the scores of query answers by integrating soft constraints, which are context-dependent and can reflect user preferences. This is achieved without disrupting the original ranking of answers, allowing for a more nuanced response to queries.
Related