{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/modeling-variations-of-first-order-horn","title":"Modeling Variations of First-Order Horn Abduction in Answer Set Programming","arxiv_id":"1512.08899","date":"2015-12-30","proceeding":null,"authors":["Peter Schüller"],"abstract":"We study abduction in First Order Horn logic theories where all atoms can be\nabduced and we are looking for preferred solutions with respect to three\nobjective functions: cardinality minimality, coherence, and weighted abduction.\nWe represent this reasoning problem in Answer Set Programming (ASP), in order\nto obtain a flexible framework for experimenting with global constraints and\nobjective functions, and to test the boundaries of what is possible with ASP.\nRealizing this problem in ASP is challenging as it requires value invention and\nequivalence between certain constants, because the Unique Names Assumption does\nnot hold in general. To permit reasoning in cyclic theories, we formally\ndescribe fine-grained variations of limiting Skolemization. We identify term\nequivalence as a main instantiation bottleneck, and improve the efficiency of\nour approach with on-demand constraints that were used to eliminate the same\nbottleneck in state-of-the-art solvers. We evaluate our approach experimentally\non the ACCEL benchmark for plan recognition in Natural Language Understanding.\nOur encodings are publicly available, modular, and our approach is more\nefficient than state-of-the-art solvers on the ACCEL benchmark.","url_abs":"http://arxiv.org/abs/1512.08899v4","url_pdf":"http://arxiv.org/pdf/1512.08899v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"modeling-variations-of-first-order-horn","repo_url":"https://bitbucket.org/knowlp/asp-fo-abduction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"natural-language-understanding","task_name":"Natural Language Understanding"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"bitbucket.org/knowlp/asp-fo-abduction","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ebf48f111fdb5752e2ee63c9477dad36a09e23c5a87e668376345c81ec77d486","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}