The logic core of Distributed Knowledge Authorization Logic, DKAL, is constructive logic with a quotation construct said. This logic is known as the logic of infons. The primal fragment of infon logic is amenable to linear time decision algorithms when policies and queries are ground. In the presence of policies with variables and implicit universal quantification, but no functions of positive arity, primal infon logic can be reduced to Datalog. We here present a practical reduction of the entailment problem for primal infon logic with individual variables to the entailment problem of Datalog. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bjørner, N., De Caso, G., & Gurevich, Y. (2012). From primal infon logic with individual variables to datalog. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7265, 72–86. https://doi.org/10.1007/978-3-642-30743-0_6
Mendeley helps you to discover research relevant for your work.