{"id":"W1634466368","doi":"10.1007/3-540-44503-x_4","title":"On Decidability and Complexity of Description Logics with Uniqueness Constraints","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Uniqueness; Equivalence (formal languages); Computer science; Successor cardinal; Monadic predicate calculus; Path (computing); Second-order logic; Time complexity; Theoretical computer science; Discrete mathematics; Mathematics; Description logic; Algorithm; Programming language; Higher-order logic","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0180174,0.002508807,0.004281966,0.00530363,0.005571195,0.01480011,0.01034772,0.005489035,0.01167171],"category_scores_gemma":[0.08377477,0.004308436,0.01010801,0.007975328,0.01413685,0.0586901,0.011481,0.02101002,0.0009154253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01106612,"about_ca_system_score_gemma":0.005309127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007206454,"about_ca_topic_score_gemma":0.006458457,"domain_scores_codex":[0.9778371,0.007796241,0.001709531,0.004066755,0.006101083,0.00248927],"domain_scores_gemma":[0.7480214,0.2345616,0.004223077,0.008071704,0.003122158,0.002000058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004352507,0.0003075983,0.002217903,0.0006848999,0.0002943985,0.0002389997,0.001225297,0.03523208,0.0009135104,0.9274906,0.005976575,0.02498286],"study_design_scores_gemma":[0.00003936482,0.00001219736,0.0001597856,0.00003245308,0.00005480981,0.00005379348,0.00007833417,0.02421455,0.0003320921,0.9744144,0.0005877809,0.0000204519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2199954,0.009434642,0.6754194,0.02766182,0.000586124,0.0004663537,0.003204894,0.001494894,0.06173647],"genre_scores_gemma":[0.834919,0.004536255,0.1397733,0.002839625,0.002135588,0.0007903989,0.003836419,0.0008606624,0.01030872],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0180174,"threshold_uncertainty_score":0.09528625,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05776546969384699,"score_gpt":0.2597399644287863,"score_spread":0.2019744947349393,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}