{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V6IODB2JTWS7L4J5MAP5TYLHFX","short_pith_number":"pith:V6IODB2J","schema_version":"1.0","canonical_sha256":"af90e187499da5f5f13d601fd9e1672dde033edd3df2275d06c1cf47d708c5dd","source":{"kind":"arxiv","id":"1707.05904","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Conditional Planning using Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.RO"],"primary_cat":"cs.AI","authors_text":"Ahmed Nouman, Esra Erdem, Ibrahim Faruk Yalciner, Volkan Patoglu","submitted_at":"2017-07-19T00:29:16Z","abstract_excerpt":"We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions and sensing actions in an expressive nonmonotonic language of answer set programming (ASP), and computation of the branches of a conditional plan in parallel using an ASP solver. In particular, thanks to external atoms, continuous feasibility checks (like collision checks) are embedded into formal representations of actuation actions and sensing actions in ASP; and thus each branch of a hybrid conditional plan des"},"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":"1707.05904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T00:29:16Z","cross_cats_sorted":["cs.LO","cs.RO"],"title_canon_sha256":"23038a824a48095e303a0861f5c6ed8c3ed1371346b7be82c4f2895ee9afecea","abstract_canon_sha256":"7f4471c9ffdeb49fab9c84e7d5aa72c98e4c02bd0f627b9c07378ddc65761b92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:58.989111Z","signature_b64":"+JE66vFxHfSciWScj1rOObo37NJYWwaYbbt93mcQCSmJkw98qhAwfe4KbtJa8QjaP6Hwd6bzdxETcSn9y9EDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af90e187499da5f5f13d601fd9e1672dde033edd3df2275d06c1cf47d708c5dd","last_reissued_at":"2026-05-18T00:39:58.988639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:58.988639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Conditional Planning using Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.RO"],"primary_cat":"cs.AI","authors_text":"Ahmed Nouman, Esra Erdem, Ibrahim Faruk Yalciner, Volkan Patoglu","submitted_at":"2017-07-19T00:29:16Z","abstract_excerpt":"We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions and sensing actions in an expressive nonmonotonic language of answer set programming (ASP), and computation of the branches of a conditional plan in parallel using an ASP solver. In particular, thanks to external atoms, continuous feasibility checks (like collision checks) are embedded into formal representations of actuation actions and sensing actions in ASP; and thus each branch of a hybrid conditional plan des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05904","kind":"arxiv","version":1},"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":"1707.05904","created_at":"2026-05-18T00:39:58.988703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05904v1","created_at":"2026-05-18T00:39:58.988703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05904","created_at":"2026-05-18T00:39:58.988703+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6IODB2JTWS7","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6IODB2JTWS7L4J5","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6IODB2J","created_at":"2026-05-18T12:31:49.984773+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/V6IODB2JTWS7L4J5MAP5TYLHFX","json":"https://pith.science/pith/V6IODB2JTWS7L4J5MAP5TYLHFX.json","graph_json":"https://pith.science/api/pith-number/V6IODB2JTWS7L4J5MAP5TYLHFX/graph.json","events_json":"https://pith.science/api/pith-number/V6IODB2JTWS7L4J5MAP5TYLHFX/events.json","paper":"https://pith.science/paper/V6IODB2J"},"agent_actions":{"view_html":"https://pith.science/pith/V6IODB2JTWS7L4J5MAP5TYLHFX","download_json":"https://pith.science/pith/V6IODB2JTWS7L4J5MAP5TYLHFX.json","view_paper":"https://pith.science/paper/V6IODB2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05904&json=true","fetch_graph":"https://pith.science/api/pith-number/V6IODB2JTWS7L4J5MAP5TYLHFX/graph.json","fetch_events":"https://pith.science/api/pith-number/V6IODB2JTWS7L4J5MAP5TYLHFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6IODB2JTWS7L4J5MAP5TYLHFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6IODB2JTWS7L4J5MAP5TYLHFX/action/storage_attestation","attest_author":"https://pith.science/pith/V6IODB2JTWS7L4J5MAP5TYLHFX/action/author_attestation","sign_citation":"https://pith.science/pith/V6IODB2JTWS7L4J5MAP5TYLHFX/action/citation_signature","submit_replication":"https://pith.science/pith/V6IODB2JTWS7L4J5MAP5TYLHFX/action/replication_record"}},"created_at":"2026-05-18T00:39:58.988703+00:00","updated_at":"2026-05-18T00:39:58.988703+00:00"}