caa a22 4500 463187113 CHVBK 20180406164857.0 cr unu---uuuuu 170326e20070601xx s 000 0 eng 10.1007/s10472-007-9070-5 doi (NATIONALLICENCE)springer-10.1007/s10472-007-9070-5 Controlled query evaluation with open queries for a decidable relational submodel [Elektronische Daten] [Joachim Biskup, Piero Bonatti] Controlled query evaluation for logic-oriented information systems provides a model for the dynamic enforcement of confidentiality policies in scenarios where users are able to reason about a priori knowledge and the answers to previous queries. Previous foundational work assumes that the control mechanism can solve the arising implication problems and deals only with closed queries. In this paper, we overcome these limitations by refining the abstract model for appropriately represented relational databases. We identify a relational submodel where all instances share a fixed infinite Herbrand domain but have finite base relations, and we require finite and domain-independent query results. Then, via suitable syntactic restrictions on the policy and query languages, each occurring implication problem can be equivalently expressed as a universal validity problem within the Bernays-Schönfinkel class, whose (known) decidability in the classical setting is extended to our framework. For refusal and lying, we design and verify evaluation methods for open queries, exploiting controlled query evaluation of appropriate sequences of closed queries, which include answer completeness tests. Additionally, we present alternative evaluation methods that work for lying and the combined approach but at the price of potentially reduced cooperativeness. Springer Science+Business Media B.V., 2007 Controlled query evaluation nationallicence Confidentiality nationallicence Refusal nationallicence Lying nationallicence Combined method nationallicence Relational database nationallicence DB-interpretation nationallicence Open query nationallicence Propositional logic nationallicence First-order logic nationallicence Safe query nationallicence Domain-independent query nationallicence Implication problem nationallicence Finite model theory nationallicence Bernays-Schönfinkel class nationallicence Description logic nationallicence Completeness test nationallicence Biskup Joachim Fachbereich Informatik, Universität Dortmund, 44221, Dortmund, Germany aut Bonatti Piero Università di Napoli "Frederico II”, 80126, Naples, Italy aut Annals of Mathematics and Artificial Intelligence Springer Netherlands 50/1-2(2007-06-01), 39-77 1012-2443 50:1-2<39 2007 50 10472 https://doi.org/10.1007/s10472-007-9070-5 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10472-007-9070-5 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Biskup Joachim Fachbereich Informatik, Universität Dortmund, 44221, Dortmund, Germany aut NATIONALLICENCE 700 1- Bonatti Piero Università di Napoli "Frederico II”, 80126, Naples, Italy aut NATIONALLICENCE 773 0- Annals of Mathematics and Artificial Intelligence Springer Netherlands 50/1-2(2007-06-01), 39-77 1012-2443 50:1-2<39 2007 50 10472 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer