A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics.

DOI10.4230/LIPIcs.CSL.2011.129zbMath1247.03013OpenAlexW2241410135MaRDI QIDQ2915678

Domenico Cantone, Marianna Nicolosi-Asmundo, Cristiano Longo

Publication date: 18 September 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_488e.html

zbMATH Keywords

set theorydescription logicNP-complete decision procedures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Set theory (03E99)

Related Items

Web ontology representation and reasoning via fragments of set theory, A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions