{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003734157,0.0006325687,0.0008393436,0.001256339,0.001280268,0.005330448,0.002306223,0.001437145,0.002607882],"category_scores_gemma":[0.01189927,0.000803976,0.002096145,0.002529748,0.004669106,0.01456087,0.00219266,0.002977135,0.0003461617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003286307,"about_ca_system_score_gemma":0.002102436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004334143,"about_ca_topic_score_gemma":0.004383346,"domain_scores_codex":[0.9944042,0.001455669,0.0005742578,0.001068226,0.001820317,0.0006773671],"domain_scores_gemma":[0.9860684,0.01000902,0.001345111,0.001506834,0.0006613639,0.000409276],"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.00006565155,0.00006824853,0.0006572257,0.000100197,0.00001936607,0.0001807395,0.0007850085,0.01250037,0.002382241,0.9715025,0.0004424603,0.01129596],"study_design_scores_gemma":[0.0000523389,0.00005927212,0.0003494259,0.00003268288,0.00004707745,0.0002777478,0.0002392382,0.07511575,0.003471964,0.9147631,0.005556833,0.00003451672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.211913,0.001058313,0.7699096,0.001723736,0.00006661739,0.0002088458,0.0008121351,0.0009554107,0.01335237],"genre_scores_gemma":[0.7406166,0.0007494802,0.2508033,0.0004531702,0.000202725,0.0003138341,0.0009773322,0.0002115689,0.005672079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005330448,"threshold_uncertainty_score":0.02384388,"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."}}