Games for query inseparability of description logic knowledge bases

DOI10.1016/j.artint.2016.01.010zbMath1351.68263WikidataQ62048604 ScholiaQ62048604MaRDI QIDQ253977

Frank Wolter, Elena Botoeva, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyashchev

Publication date: 8 March 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://eprints.bbk.ac.uk/id/eprint/14142/1/aij-final.pdf

zbMATH Keywords

computational complexity; games on graphs; description logic; knowledge base; conjunctive query; query inseparability

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91A43: Games involving graphs

91A80: Applications of game theory

68T27: Logic in artificial intelligence

68T30: Knowledge representation

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Uses Software

• ContentCVS
• Ontop