11. The system as recited in claim 8 , wherein translation is effected by matching fragment samples that are associated with respective semantics rules of the security language to corresponding fragments of the first proof graph reflecting the logic language.
8. A system comprising: one or more processors; at least one input/output interface that accepts an assertion context including multiple assertions, each assertion of the multiple assertions including a syntax of a security language, the syntax for each assertion including an asserted fact and permitting one or more conditional facts and one or more constraints; and memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: translating the assertion context into a program in a logic language; evaluating the program in the logic language in conjunction with an authorization query using a deterministic algorithm based on tabling, wherein the deterministic algorithm produces a first proof graph comprising a plurality of fragments, wherein each fragment of the plurality of fragments forms part of a structure of the first proof graph and includes at least two nodes and at least one directed edge; and translating the first proof graph reflecting the logic language into a second proof graph reflecting the security language.