{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005149825,0.001331377,0.001724185,0.00224311,0.001645655,0.006765212,0.005476448,0.002289321,0.009614649],"category_scores_gemma":[0.01173118,0.001899525,0.00338538,0.003114097,0.004162517,0.01363364,0.008314296,0.008627445,0.002577065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002797014,"about_ca_system_score_gemma":0.00232084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003282749,"about_ca_topic_score_gemma":0.003915539,"domain_scores_codex":[0.995041,0.001180958,0.0004138377,0.001091313,0.001692094,0.0005808404],"domain_scores_gemma":[0.993937,0.004005754,0.0001931471,0.0009940587,0.0006382801,0.000231678],"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.00006870602,0.00006234131,0.0001702048,0.0001870235,0.00003775847,0.00006416235,0.0004699178,0.01156365,0.001437766,0.9166726,0.0027875,0.06647839],"study_design_scores_gemma":[0.00001734091,0.00001244128,0.00002789138,0.0000505734,0.00002354061,0.00003337805,0.00008548448,0.0414798,0.001537846,0.9475347,0.009182638,0.00001441455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004025455,0.0002044663,0.9871461,0.0005799964,0.00007450829,0.00006088884,0.0001372364,0.001627919,0.006143453],"genre_scores_gemma":[0.1239991,0.0005964671,0.8596295,0.0005318761,0.0001868208,0.0002753013,0.0009577588,0.001103702,0.01271948],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009614649,"threshold_uncertainty_score":0.03216422,"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."}}