{"paper":{"title":"On Answer Substitutions in Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Keehang Kwon","submitted_at":"2017-08-17T12:45:38Z","abstract_excerpt":"Answer substitutions play a central role in logic programming. To support {\\it selective} answer substitutions, we refine $\\exists x$ in goals into two different versions: the noisy version $\\exists^o x$ and the silent version $\\exists x$. The main difference is that only the instantiation in $\\exists^o x$ will be recorded in the answer substitutions. Similarly for $\\forall x$. In addition, we discuss the notion of don't-care constants and don't-know constants."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05240","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"}