The formal representation of a legal text to automatize reasoning about them is well known in literature, and is recently gaining much attention thanks to the interest in the so-called smart contracts, and to autonomous decisions by public administrations [8,4,11]. For deterministic rules there are several proposals, often based on logic-based programming languages [9,10]. However, none of the existing proposals are able to represent the ambiguity and/or administrative discretion present in contracts and/or applicable legislation, e.g., force majeure. This paper is an extended abstract of [3], where we present a framework, called s(LAW), that allows for modeling legal rules involving ambiguity, and supports reasoning and inferring conclusions based on them. Additionally, thanks to the goal-directed execution of s(CASP) [2], the underlying system used to implement our proposal, s(LAW) provides justification [1] of the resulting conclusions (in natural language). To evaluate the expressiveness of our proposal we have translated (using a set of patterns) the procedure for awarding school places for the “Educación Secundaria Obligatoria” (ESO) of centers supported with public funds in the Comunidad de Madrid.