{"id":17685471,"url":"https://github.com/pthariensflame/satnqclause","last_synced_at":"2025-09-14T04:15:37.107Z","repository":{"id":148306789,"uuid":"266406691","full_name":"pthariensflame/SatNQClause","owner":"pthariensflame","description":"Truffle implementation of a recursive open-world solver for nested quantifier clauses","archived":false,"fork":false,"pushed_at":"2020-05-25T04:29:24.000Z","size":41,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-03-24T20:07:45.863Z","etag":null,"topics":["logic-programming","truffle-framework"],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-3-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pthariensflame.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-05-23T19:37:21.000Z","updated_at":"2020-05-25T07:16:15.000Z","dependencies_parsed_at":"2023-05-19T17:30:15.860Z","dependency_job_id":null,"html_url":"https://github.com/pthariensflame/SatNQClause","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pthariensflame%2FSatNQClause","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pthariensflame%2FSatNQClause/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pthariensflame%2FSatNQClause/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pthariensflame%2FSatNQClause/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pthariensflame","download_url":"https://codeload.github.com/pthariensflame/SatNQClause/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246375170,"owners_count":20767058,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["logic-programming","truffle-framework"],"created_at":"2024-10-24T10:27:53.316Z","updated_at":"2025-03-30T20:24:49.984Z","avatar_url":"https://github.com/pthariensflame.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SatNQClause\n\n**Heavily WIP.**  Truffle implementation of an open-world solver for [hereditary Harrop formulae](https://en.wikipedia.org/wiki/Harrop_formula#Hereditary_Harrop_formulae_and_logic_programming) over [dependenly-sorted algebras with isomorphism](https://arxiv.org/abs/1603.03092); for use internally in [Sylvia](https://github.com/pthariensflame/sylvia) (and possibly other places in the future) and inspired by [chalk](https://github.com/rust-lang/chalk).  The name is a pun on [“Santa Claus”](https://en.wikipedia.org/wiki/Santa_Claus), and is short for “Satisfiability of Nested Quantifier Clauses\".\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpthariensflame%2Fsatnqclause","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpthariensflame%2Fsatnqclause","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpthariensflame%2Fsatnqclause/lists"}