{"id":20035872,"url":"https://github.com/joao-conde/feup-plog","last_synced_at":"2026-03-19T13:10:17.682Z","repository":{"id":68247635,"uuid":"149466536","full_name":"joao-conde/feup-plog","owner":"joao-conde","description":"Repository to host the Logic Programming classe exercises and projects, a third year course @FEUP ","archived":false,"fork":false,"pushed_at":"2024-06-19T19:59:55.000Z","size":2668,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-01-22T08:29:59.388Z","etag":null,"topics":["logic-programming","prolog","prolog-programming-language"],"latest_commit_sha":null,"homepage":"","language":"Prolog","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/joao-conde.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":"2018-09-19T14:47:52.000Z","updated_at":"2024-06-19T19:59:58.000Z","dependencies_parsed_at":"2023-05-12T21:15:20.492Z","dependency_job_id":null,"html_url":"https://github.com/joao-conde/feup-plog","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/joao-conde/feup-plog","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joao-conde%2Ffeup-plog","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joao-conde%2Ffeup-plog/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joao-conde%2Ffeup-plog/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joao-conde%2Ffeup-plog/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/joao-conde","download_url":"https://codeload.github.com/joao-conde/feup-plog/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joao-conde%2Ffeup-plog/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30208068,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-07T03:24:23.086Z","status":"ssl_error","status_checked_at":"2026-03-07T03:23:11.444Z","response_time":53,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["logic-programming","prolog","prolog-programming-language"],"created_at":"2024-11-13T10:09:34.720Z","updated_at":"2026-03-07T04:33:04.107Z","avatar_url":"https://github.com/joao-conde.png","language":"Prolog","readme":"# Projects\n\nUse a SICStus Prolog installation and consult the file within the respective `src` folder of each project with the name of that project (racingkings.pl, houses.pl or zurero.pl). The following projects can be found in the [projects](projects/) folder.\n\n## Racing Kings\n\nLike a regular game of chess but no checks are allowed. The first player to move the king to the 8th rank wins. If both arrive in the same turn, it is a draw.\n\n## Zurero\n\nThis game is an interesting variation of Go-Moku, in which players \"slide\" stones along the board lines from the edge of the board till the \"sliding\" stone is stopped by another stone on the board.\n\nThe intriguing feature of the game is that the \"sliding\" stone pushes the \"stopping\" stone if there is an empty space behind it.\n\n## Houses\n\nThis project is based on a CLPFD (Constraint Logic Programming with Finite Domains) problem.\nThe Houses Puzzle’s is a puzzle created by Erich Friedman, a puzzles enthusiast, with the objective of connecting pairs of houses so that there are at max two different distances. These pairs of houses, with only one connection each, are created with the elements of a list with even number of house coordinates, which is the puzzle’s input.\n\n# Prolog Coding Conventions\n\nVariables in `PascalCase`.\n\nPredicates in `snake_case`.\n\nCommenting style from official SWI-Prolog code, public at their repository.\n* `/* */` multiline comment blocks\n* `+` can be used to describe an argument that should be instantiated\n* `-` can be used to describe an argument that the predicate will instantiate\n* `?` can be used to describe an argument which can be either instantiated or not\n\n**Example** \n\n```prolog\n/*  max_member(-Max, +List)\n    \n    True when Max is the largest  member in the standard order of terms.  \n    \n    Fails if List is empty.\n*/\n  max_member(Max, List).\n```\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjoao-conde%2Ffeup-plog","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjoao-conde%2Ffeup-plog","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjoao-conde%2Ffeup-plog/lists"}