Dyadic existential rules

DOI10.1017/S1471068423000327MaRDI QIDQ7027166zbMATH OpenFDO

Authors Georg Gottlob, M. Manna, Cinzia Marte

Publication date 14 February 2025

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://ora.ox.ac.uk/objects/uuid:81ab339f-5950-4299-b0e4-46de5ca5a9fe

zbMATH Keywords

computational complexityDatalogexistential rulestuple-generating dependenciesontology-based query answering

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Database theory (68P15) Logic in artificial intelligence (68T27)

Cites work

• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Converging to the chase -- a tool for finite controllability
• Data exchange: semantics and query answering
• Fast query answering over existential rules
• On rules with existential variables: walking the decidability line
• Taming the infinite chase: query answering under expressive relational constraints
• Testing containment of conjunctive queries under functional and inclusion dependencies
• Towards more expressive ontology languages: the query answering problem

This page was built for publication: Dyadic existential rules

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