{"id":20802161,"url":"https://github.com/megave/prolog-tasks","last_synced_at":"2026-02-25T08:06:38.171Z","repository":{"id":169587428,"uuid":"645585961","full_name":"megaVE/prolog-tasks","owner":"megaVE","description":"My solution for the tasks from the Logic Programming discipline, during the 3th period of the course | Resoluções minhas dos trabalhos propostos durante a disciplina de Programação Lógica, no 3º Período do curso","archived":false,"fork":false,"pushed_at":"2023-09-22T14:40:01.000Z","size":80,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-12T02:47:39.114Z","etag":null,"topics":["array-sorting","general-purpose","n-queens-problem","prolog-exercises"],"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/megaVE.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":"2023-05-26T01:46:36.000Z","updated_at":"2023-09-19T23:26:57.000Z","dependencies_parsed_at":null,"dependency_job_id":"d9ddb1d4-cd50-47e5-aa6b-1e7a9db53d67","html_url":"https://github.com/megaVE/prolog-tasks","commit_stats":null,"previous_names":["megave/trabalhos-prolog","megave/prolog-tasks"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/megaVE/prolog-tasks","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fprolog-tasks","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fprolog-tasks/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fprolog-tasks/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fprolog-tasks/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/megaVE","download_url":"https://codeload.github.com/megaVE/prolog-tasks/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fprolog-tasks/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29815020,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-25T05:36:42.804Z","status":"ssl_error","status_checked_at":"2026-02-25T05:36:31.934Z","response_time":61,"last_error":"SSL_read: 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":["array-sorting","general-purpose","n-queens-problem","prolog-exercises"],"created_at":"2024-11-17T18:28:30.357Z","updated_at":"2026-02-25T08:06:38.166Z","avatar_url":"https://github.com/megaVE.png","language":"Prolog","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Prolog Tasks (Trabalhos Prolog)\n\nEN: My solution for the tasks from the Logic Programming discipline, during the 3th period of the course.\n\nPT: Resoluções minhas dos trabalhos propostos durante a disciplina de Programação Lógica, no 3º Período do curso.\n\n## 1 - First Prolog program (Primeiro programa Prolog)\n\nComplete development of a program simulating a genealogical tree and its kinship relations.\n\n(Desenvolvimento completo de um programa que simula uma árvore genealógica e as relações do parentesco.)\n\n## 2 - N-Queens Problem (Problema das N-Rainhas)\n\nImplementation of the criaup and criainf predicates, along the printing functions, in a program solving the N-Queens problem.\n\n(Implementação dos predicados criaup e criainf, juntamente das funções de impressão, num programa que resolve o problema lógico das N-Rainhas.)\n\n## 3 - Sorting (Ordenação)\n\nChanges on the insertion and selection operations, so that they reverse sort a number array.\n\n(Transformação nas operações de inserção e seleção, para que façam ordenação inversa de uma lista com números.)\n\n## 4 - Missionaries and Cannibals Problem (Problema dos Missionários e Canibais)\n\nDevelopment of the predicates defining the states and possible operations in the solution tree of the missionaries and cannibals problem.\n\n(Desenvolvimento dos predicados que definem os estados e as operações possíveis na árvore de resolução do problema dos Missionários e Canibais.)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmegave%2Fprolog-tasks","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmegave%2Fprolog-tasks","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmegave%2Fprolog-tasks/lists"}