{"id":"W1492028561","doi":"10.1007/3-540-45049-1_54","title":"The Formal Specification and Implementation of a Modest First Order Temporal Logic","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Acadia University; Nortel (Canada)","funders":"","keywords":"Computer science; Programming language; Temporal logic; Logic programming; Description logic; First-order logic; Syntax; Semantics (computer science); Interval temporal logic; Theoretical computer science; 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.001967638,0.000435251,0.0004854368,0.0005790775,0.0009924249,0.002795708,0.002537898,0.001111319,0.00805811],"category_scores_gemma":[0.004577055,0.001021328,0.001184101,0.0006743897,0.002246359,0.003108596,0.001860188,0.00172798,0.001810392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105526,"about_ca_system_score_gemma":0.002331842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001831422,"about_ca_topic_score_gemma":0.00337344,"domain_scores_codex":[0.9989991,0.0001999127,0.0001240356,0.0001218418,0.0004313262,0.0001237144],"domain_scores_gemma":[0.9982326,0.0009698073,0.0001332504,0.0003681714,0.0002001634,0.00009590501],"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.0001635043,0.00006469791,0.0002953287,0.0002323586,0.00001679041,0.0001784519,0.0003716043,0.014098,0.01749017,0.9408574,0.002348312,0.02388341],"study_design_scores_gemma":[0.0001758281,0.0001981718,0.0003521392,0.0001025116,0.0001138103,0.0003699729,0.0001521569,0.3908458,0.04448813,0.4968899,0.06624034,0.00007116918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01159099,0.00006798406,0.9773903,0.0004267876,0.00006525891,0.0001647624,0.0002512693,0.002219363,0.007823101],"genre_scores_gemma":[0.222871,0.0002144763,0.7649155,0.0001738665,0.00006620378,0.000396126,0.000568042,0.0003661565,0.01042856],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00805811,"threshold_uncertainty_score":0.02695704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01619250709659672,"score_gpt":0.2542600326606247,"score_spread":0.238067525564028,"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."}}