{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/learning-interpretable-models-in-the-property","title":"Learning Interpretable Models in the Property Specification Language","arxiv_id":"2002.03668","date":"2020-02-10","proceeding":null,"authors":["Rajarshi Roy","Dana Fisman","Daniel Neider"],"abstract":"We address the problem of learning human-interpretable descriptions of a complex system from a finite set of positive and negative examples of its behavior. In contrast to most of the recent work in this area, which focuses on descriptions expressed in Linear Temporal Logic (LTL), we develop a learning algorithm for formulas in the IEEE standard temporal logic PSL (Property Specification Language). Our work is motivated by the fact that many natural properties, such as an event happening at every n-th point in time, cannot be expressed in LTL, whereas it is easy to express such properties in PSL. Moreover, formulas in PSL can be more succinct and easier to interpret (due to the use of regular expressions in PSL formulas) than formulas in LTL. Our learning algorithm builds on top of an existing algorithm for learning LTL formulas. Roughly speaking, our algorithm reduces the learning task to a constraint satisfaction problem in propositional logic and then uses a SAT solver to search for a solution in an incremental fashion. We have implemented our algorithm and performed a comparative study between the proposed method and the existing LTL learning algorithm. Our results illustrate the effectiveness of the proposed approach to provide succinct human-interpretable descriptions from examples.","url_abs":"https://arxiv.org/abs/2002.03668v1","url_pdf":"https://arxiv.org/pdf/2002.03668v1.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":[],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2002.03668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03668"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/ifm-mpi/Flie-PSL","reach":null}],"summary":{"ran":2,"ran_draft_wrong":1,"unverified":2},"by_repo_kind":{"found_in_text":{"samples":5,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"58b59041a4a91db8","entry":"Formula","repo":"ifm-mpi/Flie-PSL","repo_kind":"found_in_text","path":"samples2PSL/SATEncoding.py","file_url":"https://github.com/ifm-mpi/Flie-PSL/blob/HEAD/samples2PSL/SATEncoding.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"58b59041a4a91db8"}},{"code_sha256_prefix":"b2f42a162cc818af","entry":"SimpleTree","repo":"ifm-mpi/Flie-PSL","repo_kind":"found_in_text","path":"samples2PSL/SATEncoding.py","file_url":"https://github.com/ifm-mpi/Flie-PSL/blob/HEAD/samples2PSL/SATEncoding.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b2f42a162cc818af"}},{"code_sha256_prefix":"d42dc5181329d785","entry":"intersection","repo":"ifm-mpi/Flie-PSL","repo_kind":"found_in_text","path":"samples2PSL/SATEncoding.py","file_url":"https://github.com/ifm-mpi/Flie-PSL/blob/HEAD/samples2PSL/SATEncoding.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d42dc5181329d785"}},{"code_sha256_prefix":"9e361ec8b4a2a45d","entry":"SATEncoding","repo":"ifm-mpi/Flie-PSL","repo_kind":"found_in_text","path":"samples2PSL/SATEncoding.py","file_url":"https://github.com/ifm-mpi/Flie-PSL/blob/HEAD/samples2PSL/SATEncoding.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9e361ec8b4a2a45d"}},{"code_sha256_prefix":"177da33ed58f5153","entry":"TreeToFormula","repo":"ifm-mpi/Flie-PSL","repo_kind":"found_in_text","path":"samples2PSL/SATEncoding.py","file_url":"https://github.com/ifm-mpi/Flie-PSL/blob/HEAD/samples2PSL/SATEncoding.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"177da33ed58f5153"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}