{"id":"W2167987424","doi":"10.1109/time.2008.20","title":"Satisfying a Fragment of XQuery by Branching-Time Reduction","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Fragment (logic); Satisfiability; Computer science; XQuery; Leverage (statistics); CTL*; Branching (polymer chemistry); Boolean satisfiability problem; Decidability; Reduction (mathematics); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Chemistry; XML","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.002164958,0.0009217167,0.0008363776,0.0009181298,0.001046404,0.002365668,0.002199583,0.001241719,0.005436322],"category_scores_gemma":[0.007638034,0.0007667139,0.001978948,0.001274094,0.002893041,0.004022826,0.002450335,0.00270573,0.0005472252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001846055,"about_ca_system_score_gemma":0.002559769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01034595,"about_ca_topic_score_gemma":0.009963583,"domain_scores_codex":[0.9964846,0.0006479451,0.0001786926,0.0008213192,0.001352683,0.0005148115],"domain_scores_gemma":[0.9960229,0.002403505,0.0003635501,0.0006306258,0.000449914,0.0001294052],"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.001056004,0.0005575684,0.007145069,0.000762544,0.0002506028,0.003163786,0.001820234,0.1948659,0.06929264,0.5916419,0.01179415,0.1176498],"study_design_scores_gemma":[0.0002871138,0.0002188875,0.0009098109,0.00006656429,0.0001632283,0.0006580229,0.0003822847,0.4405596,0.04156111,0.504163,0.01094732,0.00008292676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1539154,0.0003256914,0.8221178,0.002141007,0.00008945876,0.0004815587,0.001235355,0.006530129,0.01316366],"genre_scores_gemma":[0.7001795,0.0002675748,0.2883502,0.0008401391,0.00008795669,0.0002980814,0.002538272,0.001006743,0.006431518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01034595,"threshold_uncertainty_score":0.02057147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01843861241304052,"score_gpt":0.248989714332751,"score_spread":0.2305511019197105,"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."}}