{"id":21943638,"url":"https://github.com/ben-marshall/sat-solver","last_synced_at":"2025-03-22T15:46:07.655Z","repository":{"id":95888250,"uuid":"96709773","full_name":"ben-marshall/sat-solver","owner":"ben-marshall","description":"A simple combinatorial boolean sat solver based on the AC-3 Algorithm","archived":false,"fork":false,"pushed_at":"2017-08-05T12:14:15.000Z","size":160,"stargazers_count":1,"open_issues_count":2,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-03T17:49:12.540Z","etag":null,"topics":["ac-3","bison","c","sat-solver","satisfiability","satisfiability-solver","yacc"],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ben-marshall.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2017-07-09T20:32:49.000Z","updated_at":"2024-08-08T14:33:38.000Z","dependencies_parsed_at":"2023-03-13T16:43:56.205Z","dependency_job_id":null,"html_url":"https://github.com/ben-marshall/sat-solver","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/ben-marshall%2Fsat-solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ben-marshall%2Fsat-solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ben-marshall%2Fsat-solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ben-marshall%2Fsat-solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ben-marshall","download_url":"https://codeload.github.com/ben-marshall/sat-solver/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244981293,"owners_count":20542288,"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":["ac-3","bison","c","sat-solver","satisfiability","satisfiability-solver","yacc"],"created_at":"2024-11-29T03:33:47.207Z","updated_at":"2025-03-22T15:46:07.634Z","avatar_url":"https://github.com/ben-marshall.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n# SAT Solver\n\n[![Build Status](https://travis-ci.org/ben-marshall/sat-solver.svg?branch=master)](https://travis-ci.org/ben-marshall/sat-solver)\n[![Documentation](https://codedocs.xyz/ben-marshall/sat-solver.svg)](https://codedocs.xyz/ben-marshall/sat-solver/)\n\nA simple SAT Solver based on the AC-3 Algorithm\n\n---\n\nThis is a simple SAT solver based on the AC-3 Algorithm. It takes sets of\nboolean expressions over a set of one or more variables, and computes whether\nthe expression(s) are *satisfiable*, that is: can be evaluated as true for\nsome set of inputs.\n\nThe aim is to use this as a testbed for experimenting with SAT Solvers,\nlooking at how they can be optimised for space/time complexity, and eventually\nimplemented in hardware.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fben-marshall%2Fsat-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fben-marshall%2Fsat-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fben-marshall%2Fsat-solver/lists"}