{"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/using-smt-solvers-to-validate-models-for-ai","title":"Using SMT Solvers to Validate Models for AI Problems","arxiv_id":"1903.09475","date":"2019-03-22","proceeding":null,"authors":["Andrei Arusoaie","Ionut Pistol"],"abstract":"Artificial Intelligence problems, ranging form planning/scheduling up to game\ncontrol, include an essential crucial step: describing a model which accurately\ndefines the problem's required data, requirements, allowed transitions and\nestablished goals. The ways in which a model can fail are numerous and often\nlead to a failure of search strategies to provide a quick, optimal, or even any\nsolution. This paper proposes using SMT (Satisfiability Modulo Theories)\nsolvers, such as Z3, to check the validity of a model. We propose two tests:\nchecking whether a final(goal) state exists in the model's described problem\nspace and checking whether the transitions described can provide a path from\nthe identified initial states to any the goal states (meaning a solution has\nbeen found). The advantage of using an SMT solver for AI model checking is that\nthey substitute actual search strategies and they work over an abstract\nrepresentation of the model, that is, a set of logical formulas. Reasoning at\nan abstract level is not as expensive as exploring the entire solution space.\nSMT solvers use efficient decision procedures which provide proofs for the\nlogical formulas corresponding to the AI model. A recent addition to Z3 allowed\nus to describe sequences of transitions as a recursive function, thus we can\ncheck if a solution can be found in the defined model.","url_abs":"http://arxiv.org/abs/1903.09475v1","url_pdf":"http://arxiv.org/pdf/1903.09475v1.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":"using-smt-solvers-to-validate-models-for-ai","repo_url":"https://github.com/andreiarusoaie/z3-ai-model-verification","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"scheduling","task_name":"Scheduling"}],"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":"andreiarusoaie/z3-ai-model-verification","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":"f8eea1093908ebcfdb46dc0756869b90e220a0439fc394453d58d97e381294eb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}