{"paper":{"title":"Conjunctive Query Answering via a Fragment of Set Theory (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniele Francesco Santamaria, Domenico Cantone, Marianna Nicolosi-Asmundo","submitted_at":"2016-06-23T14:57:27Z","abstract_excerpt":"We address the problem of Conjunctive Query Answering (CQA) for the description logic $\\dlssx$ ($\\shdlssx$, for short) which extends the logic $\\dlss$ with Boolean operations on concrete roles and with the product of concepts.\n  The result is obtained by formalizing $\\shdlssx$-knowledge bases and $\\shdlssx$-conjunctive queries in terms of formulae of the four-level set-theoretic fragment $\\flqsr$, which admits a restricted form of quantification on variables of the first three levels and on pair terms. We solve the CQA problem for $\\shdlssx$ through a decision procedure for the satisfiability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07337","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}