{"id":32162731,"url":"https://github.com/enolan/alandeniseericlauren","last_synced_at":"2026-02-23T04:34:02.757Z","repository":{"id":62435446,"uuid":"48010613","full_name":"enolan/AlanDeniseEricLauren","owner":"enolan","description":"Efficiently find minimal subsets/submaps","archived":false,"fork":false,"pushed_at":"2016-08-27T03:06:12.000Z","size":315,"stargazers_count":3,"open_issues_count":1,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-09-20T18:30:46.089Z","etag":null,"topics":["algorithm","haskell-library"],"latest_commit_sha":null,"homepage":"","language":"Haskell","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/enolan.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}},"created_at":"2015-12-15T00:53:46.000Z","updated_at":"2020-02-14T02:17:55.000Z","dependencies_parsed_at":"2022-11-01T21:16:14.992Z","dependency_job_id":null,"html_url":"https://github.com/enolan/AlanDeniseEricLauren","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/enolan/AlanDeniseEricLauren","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/enolan%2FAlanDeniseEricLauren","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/enolan%2FAlanDeniseEricLauren/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/enolan%2FAlanDeniseEricLauren/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/enolan%2FAlanDeniseEricLauren/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/enolan","download_url":"https://codeload.github.com/enolan/AlanDeniseEricLauren/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/enolan%2FAlanDeniseEricLauren/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":280272340,"owners_count":26302260,"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","status":"online","status_checked_at":"2025-10-21T02:00:06.614Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithm","haskell-library"],"created_at":"2025-10-21T14:01:34.008Z","updated_at":"2025-10-21T14:02:18.042Z","avatar_url":"https://github.com/enolan.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"AlanDeniseEricLauren is an implementation of the ADEL algorithm for efficiently\nfinding the minimal subset of an input set satisfying some arbitrary\nupward-closed property. \"Upward-closed\" means if the property is true of some\nset S it is true of all supersets of S. My implementation is trivially extended\nto maps (dictionaries).\n\nThis can be used for e.g. narrowing down bugs by finding the minimal subset of\na complex failing test case that still exhibits the issue. In addition, I\nprovide a method for finding the minimal set of *changes* between a known-good\nand known-bad example needed to trigger a bug. (Equivalently, a set where the\nproperty is false and a set where it's true.)\n\nThe ADEL algorithm is due to Philippe Laborie in his paper \"An Optimal Iterative\nAlgorithm for Extracting MUCs in a Black-box Constraint Network\" published in\nECAI 2014. doi:10.3233/978-1-61499-419-0-1051. The paper is available at\nhttp://ebooks.iospress.nl/publication/37115.\n\nThe project's homepage is https://github.com/enolan/AlanDeniseEricLauren. Bug\nreports and PRs can be submitted there.\n\nAs of August 2016, I am looking for work. If your company needs a good\nprogrammer, my email is echo@echonolan.net. My resume is available\n[here](http://www.echonolan.net/resume/cv.html).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fenolan%2Falandeniseericlauren","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fenolan%2Falandeniseericlauren","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fenolan%2Falandeniseericlauren/lists"}