Abstract: Techniques are provided for processing rules expressed in a domain-specific language. A computing system may receive a rule including an entity identifier, a property of the entity, and one or more logical operators delimited by syntactic tokens of the language. The rule is parsed into an abstract syntax tree (AST) representation that structurally represents entities, properties, and conditional logic, and the AST is transformed into an executable function configured to evaluate input data objects defined according to a machine-readable data model. Execution of the function on input data produces a logical outcome along with intermediate results corresponding to evaluations of individual conditions and logical operators. The computing system generates an execution trace comprising the logical outcome and the intermediate results, the trace being stored in a structured log retrievable to provide evidence of how outcomes were determined.