{"id":"W2946162694","doi":"10.1007/978-3-030-20528-7_12","title":"Towards Dynamic Answer Set Programming over Finite Traces","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Linear temporal logic; Dynamic logic (digital electronics); Temporal logic; Converse; Set (abstract data type); Context (archaeology); Answer set programming; Theoretical computer science; Interval temporal logic; Temporal logic of actions; Dynamic programming; Logic programming; Programming language; Algorithm; Mathematics","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009973312,0.0007886579,0.0007605716,0.0008061943,0.0002886218,0.001160179,0.004634196,0.0005294922,0.00006247604],"category_scores_gemma":[0.000137948,0.000658293,0.0002691968,0.0007927547,0.000692363,0.0009420543,0.001717993,0.001099768,0.0002128894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003747689,"about_ca_system_score_gemma":0.001135121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003275828,"about_ca_topic_score_gemma":0.0001982559,"domain_scores_codex":[0.9949139,0.00005043655,0.000576073,0.002158277,0.001202081,0.001099279],"domain_scores_gemma":[0.9968208,0.0005227092,0.0003713472,0.00176979,0.0002754811,0.0002398856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005935572,0.00004235372,0.0001646689,0.00008562445,0.00002114337,0.0001137836,0.002212174,0.00617827,0.00003527834,0.02179687,0.00004374137,0.9693002],"study_design_scores_gemma":[0.0005816945,0.0004681953,0.0008266559,0.0006346427,0.00002230495,0.0001115162,6.457702e-7,0.8790537,0.0002860001,0.08444336,0.03189795,0.001673398],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002165485,0.001250276,0.9811714,0.000352648,0.003950603,0.0006018229,0.000009035269,0.0003150909,0.01213258],"genre_scores_gemma":[0.464257,0.0001840697,0.5255155,0.002256571,0.001060505,0.00002945761,0.00003100437,0.0001274227,0.006538506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9676268,"threshold_uncertainty_score":0.9998767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01576398613280381,"score_gpt":0.2569358012840304,"score_spread":0.2411718151512266,"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."}}