Finite-model reasoning for graph queries and description logics

DOI10.1007/978-3-031-80283-6_2MaRDI QIDQ6970694zbMATH OpenFDO

Authors Filip Murlak

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-80283-6_2

zbMATH Keywords

conjunctive regular path queriesdescription logicsfinite-model reasoningquery entailment

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites work

• An introduction to description logic
• Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
• Data-complexity of the two-variable fragment with counting quantifiers
• Finite satisfiability of unary negation fragment with transitivity
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 3310090 (Why is no real title available?)
• Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
• Querying graphs
• Querying the Guarded Fragment

Cited in

(1)

• On graph queries and modal constraints (invited talk)

This page was built for publication: Finite-model reasoning for graph queries and description logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970694)