{"id":"W1654250191","doi":"","title":"On Decidability and Complexity of Description Logics with Uniqueness Constraints.","year":2000,"lang":"en","type":"article","venue":"","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Uniqueness; Equivalence (formal languages); Computer science; Successor cardinal; Path (computing); Monadic predicate calculus; Description logic; Datalog; Theoretical computer science; Logical consequence; Mathematics; Discrete mathematics; Programming language; Artificial intelligence; 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.01259668,0.001609145,0.002399764,0.003151622,0.003832057,0.01089735,0.006948407,0.004415856,0.01133573],"category_scores_gemma":[0.0796813,0.001868924,0.005988292,0.005096568,0.009274211,0.03295565,0.008655119,0.0140702,0.0009250829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00800899,"about_ca_system_score_gemma":0.004664906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006363031,"about_ca_topic_score_gemma":0.00611741,"domain_scores_codex":[0.9847756,0.004801292,0.001061849,0.003389575,0.003842768,0.00212891],"domain_scores_gemma":[0.8071366,0.1787598,0.004279244,0.00569726,0.002438493,0.001688724],"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.0007024185,0.0005752298,0.004937856,0.001344312,0.0003542897,0.0006271335,0.002299633,0.05769263,0.002267914,0.8745669,0.009875323,0.04475647],"study_design_scores_gemma":[0.00007666987,0.00002481359,0.0002976962,0.00004451048,0.00007049425,0.0001405797,0.0001374381,0.05883772,0.0007444165,0.9382645,0.001337787,0.0000234172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2165658,0.005250298,0.7123824,0.02511924,0.0004619824,0.0005638587,0.004031756,0.001612512,0.03401218],"genre_scores_gemma":[0.8142332,0.002497597,0.1657382,0.003055562,0.001495909,0.0009011179,0.004828844,0.0005416417,0.006707932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01259668,"threshold_uncertainty_score":0.06661844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0661053237975257,"score_gpt":0.2542591166844839,"score_spread":0.1881537928869582,"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."}}