{"id":20122584,"url":"https://github.com/gabryv00/automatedreasoning-project","last_synced_at":"2026-06-17T16:32:12.309Z","repository":{"id":176313166,"uuid":"655320571","full_name":"GabryV00/AutomatedReasoning-Project","owner":"GabryV00","description":"Modeling the most efficient path problem in MiniZinc and in Logic Programming","archived":false,"fork":false,"pushed_at":"2023-06-18T15:08:07.000Z","size":304,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-25T21:52:26.866Z","etag":null,"topics":["answer-set-programming","constraint-programming","minizinc","most-efficient-path"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GabryV00.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-06-18T14:47:42.000Z","updated_at":"2023-11-29T21:57:59.000Z","dependencies_parsed_at":null,"dependency_job_id":"1681ff54-7be1-4e4e-ad0a-3a2ad47f15a6","html_url":"https://github.com/GabryV00/AutomatedReasoning-Project","commit_stats":null,"previous_names":["gabryv00/automatedreasoning-project"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/GabryV00/AutomatedReasoning-Project","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GabryV00%2FAutomatedReasoning-Project","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GabryV00%2FAutomatedReasoning-Project/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GabryV00%2FAutomatedReasoning-Project/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GabryV00%2FAutomatedReasoning-Project/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GabryV00","download_url":"https://codeload.github.com/GabryV00/AutomatedReasoning-Project/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GabryV00%2FAutomatedReasoning-Project/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34454709,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-17T02:00:05.408Z","response_time":127,"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":["answer-set-programming","constraint-programming","minizinc","most-efficient-path"],"created_at":"2024-11-13T19:39:07.355Z","updated_at":"2026-06-17T16:32:12.291Z","avatar_url":"https://github.com/GabryV00.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# AutomatedReasoning-Project\nModeling the most efficient path problem in MiniZinc and in Logic Programming\n![testo alt](/descrizione_problema.png \"Detailed description of the problem to be modeled\")\n## Goal of the project\n\nThe goal of the project is to implement two models, one in MiniZinc and one in Logic Programming, to efficiently solve the problem of finding the most efficient path.\n\n## Architecture\n\nThe project consists of the following parts:\n* The *models* folder contains the model in MiniZinc and the one in Logic Programming\n* The *data* folder contains 30 input instances, of varying difficulty\n* The *generator.py* file generates test data instances for the models, based on the input parameters\n* The pdf file is a well detailed report (written in Italian) in which the problem is introduced, the implementation in MiniZinc and the one in Answer Set Programming are explained and finally the results of the tests carried out are reported\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgabryv00%2Fautomatedreasoning-project","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgabryv00%2Fautomatedreasoning-project","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgabryv00%2Fautomatedreasoning-project/lists"}