{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007060618,0.0003605498,0.0005299647,0.0003665244,0.0001385246,0.0001944284,0.001412388,0.0002253286,0.00001237724],"category_scores_gemma":[0.0001167816,0.0002701342,0.00005070224,0.000351149,0.004656865,0.0003108021,0.0005242836,0.0004115039,0.000002303841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001378994,"about_ca_system_score_gemma":0.0003269343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004880032,"about_ca_topic_score_gemma":0.0002661261,"domain_scores_codex":[0.9975412,0.0000482809,0.0003711813,0.001048557,0.000620438,0.0003703236],"domain_scores_gemma":[0.997843,0.0005856054,0.0002618643,0.0009503385,0.0002592103,0.0001000081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003565793,0.0000685261,0.001909541,0.00007914634,0.00001255918,0.00009850767,0.0004602504,0.004433904,0.00009069646,0.4037475,0.000004052408,0.5890597],"study_design_scores_gemma":[0.000388771,0.0006644275,0.009835867,0.000523339,0.000009156729,0.0001931938,7.110634e-7,0.06487829,0.001403594,0.9215333,0.0000664492,0.0005028317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008177961,0.0001199645,0.9866872,0.0003484518,0.0003563263,0.0003292189,0.000004064761,0.00008612617,0.003890667],"genre_scores_gemma":[0.7512191,0.00002709714,0.2483302,0.0003592797,0.00003308394,0.000002596531,0.000001246406,0.00000819166,0.00001921703],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7430412,"threshold_uncertainty_score":0.9999751,"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."}}