{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:UXQ2UG7WEHBICGFWL2W4P5UE4D","short_pith_number":"pith:UXQ2UG7W","schema_version":"1.0","canonical_sha256":"a5e1aa1bf621c28118b65eadc7f684e0f917be28a3a31f60a04c742627937ae4","source":{"kind":"arxiv","id":"cs/0510012","version":2},"attestation_state":"computed","paper":{"title":"On relating CTL to Datalog","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugenie Foustoucos, Foto Afrati, Irene Guessarian, Theodore Andronikos, Vassia Pavlaki","submitted_at":"2005-10-04T17:29:48Z","abstract_excerpt":"CTL is the dominant temporal specification language in practice mainly due to the fact that it admits model checking in linear time. Logic programming and the database query language Datalog are often used as an implementation platform for logic languages. In this paper we present the exact relation between CTL and Datalog and moreover we build on this relation and known efficient algorithms for CTL to obtain efficient algorithms for fragments of stratified Datalog. The contributions of this paper are: a) We embed CTL into STD which is a proper fragment of stratified Datalog. Moreover we show "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"cs/0510012","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2005-10-04T17:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"0ff429a1a40f19e4a841abed7a994806643db3070b2aa1997c30fa411cfc1904","abstract_canon_sha256":"aca5ea092f7abdcf48eb03b668a8a7e0e1f43a5fb62ec2eff0892be88908000c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:48.991067Z","signature_b64":"kCoBpNyI6P13bd+Vwq3NFpxjx/4j7trDPAckjEJCxgJG8JuyJza5Qf/G58UCZR8vIkzlE1J6WaTr34/yK80gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5e1aa1bf621c28118b65eadc7f684e0f917be28a3a31f60a04c742627937ae4","last_reissued_at":"2026-05-18T01:06:48.990401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:48.990401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On relating CTL to Datalog","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugenie Foustoucos, Foto Afrati, Irene Guessarian, Theodore Andronikos, Vassia Pavlaki","submitted_at":"2005-10-04T17:29:48Z","abstract_excerpt":"CTL is the dominant temporal specification language in practice mainly due to the fact that it admits model checking in linear time. Logic programming and the database query language Datalog are often used as an implementation platform for logic languages. In this paper we present the exact relation between CTL and Datalog and moreover we build on this relation and known efficient algorithms for CTL to obtain efficient algorithms for fragments of stratified Datalog. The contributions of this paper are: a) We embed CTL into STD which is a proper fragment of stratified Datalog. Moreover we show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0510012","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0510012","created_at":"2026-05-18T01:06:48.990505+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0510012v2","created_at":"2026-05-18T01:06:48.990505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0510012","created_at":"2026-05-18T01:06:48.990505+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXQ2UG7WEHBI","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXQ2UG7WEHBICGFW","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXQ2UG7W","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D","json":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D.json","graph_json":"https://pith.science/api/pith-number/UXQ2UG7WEHBICGFWL2W4P5UE4D/graph.json","events_json":"https://pith.science/api/pith-number/UXQ2UG7WEHBICGFWL2W4P5UE4D/events.json","paper":"https://pith.science/paper/UXQ2UG7W"},"agent_actions":{"view_html":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D","download_json":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D.json","view_paper":"https://pith.science/paper/UXQ2UG7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0510012&json=true","fetch_graph":"https://pith.science/api/pith-number/UXQ2UG7WEHBICGFWL2W4P5UE4D/graph.json","fetch_events":"https://pith.science/api/pith-number/UXQ2UG7WEHBICGFWL2W4P5UE4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D/action/storage_attestation","attest_author":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D/action/author_attestation","sign_citation":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D/action/citation_signature","submit_replication":"https://pith.science/pith/UXQ2UG7WEHBICGFWL2W4P5UE4D/action/replication_record"}},"created_at":"2026-05-18T01:06:48.990505+00:00","updated_at":"2026-05-18T01:06:48.990505+00:00"}