{"id":25946912,"url":"https://github.com/pjritee/pl_search_cpp","last_synced_at":"2025-03-04T10:17:22.846Z","repository":{"id":280092729,"uuid":"925910848","full_name":"pjritee/pl_search_cpp","owner":"pjritee","description":"A C++ module that uses Prolog ideas for search and constraint programming","archived":false,"fork":false,"pushed_at":"2025-03-01T06:59:56.000Z","size":2797,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-01T07:27:12.560Z","etag":null,"topics":["backtracking-search","constraint-logic-programming","constraint-programming","cplusplus","prolog"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pjritee.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","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":"2025-02-02T03:27:11.000Z","updated_at":"2025-03-01T07:00:00.000Z","dependencies_parsed_at":"2025-03-01T07:37:46.960Z","dependency_job_id":null,"html_url":"https://github.com/pjritee/pl_search_cpp","commit_stats":null,"previous_names":["pjritee/pl_search_cpp"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pjritee%2Fpl_search_cpp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pjritee%2Fpl_search_cpp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pjritee%2Fpl_search_cpp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pjritee%2Fpl_search_cpp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pjritee","download_url":"https://codeload.github.com/pjritee/pl_search_cpp/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241827168,"owners_count":20026601,"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":["backtracking-search","constraint-logic-programming","constraint-programming","cplusplus","prolog"],"created_at":"2025-03-04T10:17:22.140Z","updated_at":"2025-03-04T10:17:22.834Z","avatar_url":"https://github.com/pjritee.png","language":"C++","readme":"# PLSearchCPP\n\nPLSearchCPP is a C++ library that approximates Prolog predicates using a continuation-passing style. It provides a framework for defining and executing Prolog-like predicates, including support for backtracking, choice points, and unification.\n\n## Features\n\n- Prolog-like predicates\n- Continuation-passing style execution\n- Backtracking and choice points\n- Unification of terms\n- Support for variables, integers, floats, atoms, and lists\n\n## Installation\n\n### Prerequisites\n\n- C++11 or later\n- CMake 3.10 or later\n\n### Building the Library\n\n1. Clone the repository:\n\n```sh\ngit clone https://github.com/yourusername/PLSearchCPP.git\ncd PLSearchCPP\n```\n\n2. Create a build directory and navigate to it:\n\n```sh\nmkdir build\ncd build\n```\n\n3: Run CMake to configure the project:\n\n```sh\ncmake ..\n```\n\n4: Build the project:\n\n```sh\nmake\n```\n\nThis will build the pl_search library and place it in the lib directory.\n\n## Examples\n\nThe examples directory contains the following examples of using the library.\n\n- A solver for the SEND+MORE=MONEY puzzle with lots of comments about the approach and code details (\u003ccode\u003esend_more_money.cpp\u003c/code\u003e).\n- An example of a user defined Term type (\u003ccode\u003eprolog_list.hpp\u003c/code\u003e).\n- An implementation of the Prolog append predicate using the above type (\u003ccode\u003eappend_pred.hpp\u003c/code\u003e).\n- A main program ( \u003ccode\u003eprolog_list.cpp\u003c/code\u003e) that exercises the definitions above.\n- A Makefile to build the executables.\n\n## Documentation\n\nDocumentation can be found here [docs/index.html](https://pjritee.github.io/pl_search_cpp/docs/html/index.html)\n\n## License\n\nThis project is licensed under the MIT License - see the LICENSE file for details.\n\n## Version History\n\n* 1.1 \n  - Fix problems in unify\n  - Remove the test_choice method from Pred\n  - merge solve into main in send_more_money.cpp for better testing with valgrind\n* 1.0  \n  - Initial release.","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpjritee%2Fpl_search_cpp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpjritee%2Fpl_search_cpp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpjritee%2Fpl_search_cpp/lists"}