[Call for Testing] xpSHACL: Natural Language Explanations for SHACL Violations

Dear public-shacl mailing list members,

  We would like to invite you to test a new tool called xpSHACL, which aims
to enhance SHACL validation to a broader audience by providing natural
language explanations and suggestions for violations.

  The goal of xpSHACL is to make SHACL validation results more accessible
and understandable, particularly for business users who may not be SHACL
experts. It processes SHACL validation reports and uses large language
models (LLMs) to generate human-readable descriptions of *why* a violation
occurred and *how* it might be fixed. The system also includes a knowledge
graph for caching explanations and supports multiple languages.

  We have reached a point where we would greatly appreciate community
testing and feedback to help us improve the tool.

  You can find the xpSHACL application code and instructions on how to run
it on GitHub: https://github.com/gcpdev/xpshacl

  Please follow the instructions in the README file to set up and run the
validator on your own data graphs and SHACL shapes, or using the examples
provided. If you are used to Python and LLM applications, having it up and
running should not take longer than 5 minutes.

  After you have had a chance to test the application, we would be very
grateful if you could share your experience and feedback by filling out
this short questionnaire: https://forms.gle/VfgMzjHGU3oCVpw46

  Your input on the clarity and usefulness of the generated explanations,
the ease of use, and the efficiency of the tool, plus any issues you
encounter, will be considered for further development.

  If you have any questions about the project or encounter specific
technical issues during testing, please feel free to reply to this thread
on the mailing list, open an issue, or contact us directly.

  Thank you for your time and contribution to the SHACL community!

Best regards,
Gustavo Correa Publio
Jose Emilio Labra Gayo

Received on Wednesday, 7 May 2025 09:37:41 UTC