This paper proposes a validation framework that combines the flexibility of LLMs with the logic reasoning capabilities of Answer Set Programming as a complementary layer to existing guardrail mechanisms and demonstrates the practical implementation through a modular architecture that supports customizable validation components.
Abstract
Large language models (LLMs) have demonstrated significant capabilities in natural language understanding and decision support. However, their deployment in critical environments requires robust mechanisms to ensure dependability and prevent erroneous inputs or outputs from compromising system dependability. This paper presents a symbolic logic reasoning approach for enhancing the validation of both user inputs and LLM outputs in critical systems. We propose a validation framework that combines the flexibility of LLMs with the logic reasoning capabilities of Answer Set Programming (ASP) as a complementary layer to existing guardrail mechanisms. The approach enables systematic validation through declarative patterns for fault tolerance and logic reasoning. Our method validates user prompts and LLM responses against external knowledge bases and domain-specific constraints using multiple strategies, including redundancy-based validation, knowledge base auditing, and consistency checking. By transforming natural language interactions into logical representations, the framework leverages ASP’s non-monotonic reasoning to detect logical inconsistencies, contradictions, knowledge reproduction errors, and constraint violations throughout the interaction pipeline. The system provides both binary decision outputs (Go/NoGo) and detailed feedback about the reasoning artifacts for auditability and explainability. We demonstrate the practical implementation through a modular architecture that supports customizable validation components.
EntailLLM is presented, which validates each LLM-proposed analyst path by entailment: the path is a traversal of the binary's function call graph, the domain knowledge is represented in a separate graph, and verification aligns the two under temporal annotated logic.
Kaustuv Mukherji, J. Patil, C. Payne et al.· 0 citations
It is argued that semantic RAG is fundamentally unsuited for rule enforcement, and that Euclid-MCP can serve as a stable, shared reasoning substrate for both RAG-based assistants and agentic systems.
A unified supervision framework is introduced that embeds programmatically verifiable checkers into synthesized instruction-conflict instances, enabling alignment without oracle labels or reasoning traces, supporting both instruction-tuned and reasoning models.
Sian-Yao Huang, Li-Hsien Chang, Che-Yu Lin et al.· Neural Information Processin...· 4 citations
This paper presents a framework integrating Knowledge Graphs and Large Language Models to support a more extensible design review environment, and demonstrates its ability to retrieve and execute existing rules from the KG, capture new requests during design, and maintain a verifiable, adaptive compliance checking syst...
Maen Alnuzha, Tanya Bloch· Journal of Information Techn...· 1 citation
SIRNA significantly reduces the number of false positives and false negatives while offering explainability for its findings, and is generalizable to domains where business logic exists in both natural language documentation and programmatic implementation.
Joseph Tafese, Milad Hooshyar, Sam Bayless et al.· 0 citations
In fast-evolving software systems, effective 'natural language requirements parsing' and downstream change effect analysis capability across a multitude of codes represents low-hanging-fruit in this regard. We present a structured framework to deploy Large Language Models (LLMs) for automating two essential software en...
Nithya Krishnan, Kumaran Ramanujam, Suresh Babu Narra et al.· 2026 International Conferenc...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.