RUS  ENG
Full version
JOURNALS // Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics] // Archive

Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2025 Issue 3, Pages 5–24 (Mi vtpmk754)

Mathematical Logic, Algebra, Number Theory and Discrete Mathematics

Conjunctive queries to knowledge bases: Which semantics should we choose?

S. P. Kikot'a, M. Rybakovbca

a Higher School of Modern Mathematics, MIPT, Moscow
b Tver State University, Tver
c National Research University Higher School of Economics, Moscow

Abstract: In the field of computer science known as “knowledge representation,” the following paradigm has become standard in recent years. A knowledge base refers to an architecture that combines data, general knowledge, and a reasoning mechanism that can generate new information from the underlying data and knowledge, using it to answer user queries. In this survey, we focus on the scenario where the data consists of a set of ground atoms, the knowledge is represented by an ontology in some description logic, and the query language is conjunctive queries. The aim of this work is to consolidate both theoretical and practical results about the computational complexity of query answering procedures, depending on the semantics, that is, the formal definition of what constitutes an answer to a query.

Keywords: knowledge bases, conjunctive queries, query answering, semantics.

UDC: 510.6, 004.6, 164.2

Received: 05.08.2025
Revised: 25.08.2025
Accepted: 06.10.2025

DOI: 10.26456/vtpmk754



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026