A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases
From MaRDI portal
Publication:2946749
DOI10.1145/2637477zbMath1354.68259OpenAlexW2004892811WikidataQ29396864 ScholiaQ29396864MaRDI QIDQ2946749
Giora Slutzki, Jia Tao, Vasant Honavar
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2637477
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Agent technology and artificial intelligence (68T42)
Uses Software
Cites Work
- Unnamed Item
- Attributive concept descriptions with complements
- Why Horn formulas matter in computer science: initial structures and generic examples
- Decidable fragments of first-order temporal logics
- Handbook on Ontologies
- Flexible support for multiple access control policies
- Description Logics
- Communication Theory of Secrecy Systems*
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Answering queries without revealing secrets
- Encryption and Fragmentation for Data Confidentiality in the Cloud
- DESCRIPTION LOGICS OVER LATTICES
- An overview of tableau algorithms for description logics
This page was built for publication: A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases