{"id":"W2044842674","doi":"10.1145/1227839.1227843","title":"Logical definability and query languages over ranked and unranked trees","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Unary operation; Tree automaton; Mathematics; Binary relation; Polynomial hierarchy; Tree (set theory); Discrete mathematics; Quantifier (linguistics); Satisfiability; Regular language; Theoretical computer science; Combinatorics; Computer science; Automaton; Time complexity; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.0005099186,0.0001671449,0.0001934262,0.0001247179,0.0002615948,0.0001234601,0.0002728609,0.0001076798,0.00002518723],"category_scores_gemma":[0.00005014265,0.0001337669,0.00006509464,0.0002439316,0.0001618614,0.0002164722,0.00002346921,0.0001719098,0.00001508991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003628893,"about_ca_system_score_gemma":0.00003076231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001301757,"about_ca_topic_score_gemma":0.0001597956,"domain_scores_codex":[0.9986942,0.00009360341,0.0002598865,0.0004452708,0.0002634069,0.0002436406],"domain_scores_gemma":[0.9986282,0.0008266848,0.00006307317,0.0002895049,0.00007530813,0.0001172106],"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.0001327118,0.0006469938,0.009454044,0.00007496299,0.0001280992,0.00009947708,0.001242061,0.006915174,0.0001543403,0.7306288,0.00007277896,0.2504506],"study_design_scores_gemma":[0.001471378,0.0004973903,0.4559462,0.000007581141,0.00002853024,0.0001989828,0.000175173,0.01113386,0.0001106452,0.5289695,0.00103447,0.0004263217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1076743,0.0002639216,0.8902591,0.0006993489,0.0001401498,0.0001993078,0.000002733822,0.0001814505,0.0005796861],"genre_scores_gemma":[0.9697906,0.00001251172,0.0296037,0.0004739383,0.00003529699,0.00001178799,0.000005949457,0.000006072619,0.00006019183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8621163,"threshold_uncertainty_score":0.5454856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02634749071562523,"score_gpt":0.2864411757482443,"score_spread":0.2600936850326191,"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."}}