https://github.com/gabryv00/automatedreasoning-project

Modeling the most efficient path problem in MiniZinc and in Logic Programming
https://github.com/gabryv00/automatedreasoning-project

answer-set-programming constraint-programming minizinc most-efficient-path

Last synced: 3 months ago
JSON representation

Modeling the most efficient path problem in MiniZinc and in Logic Programming

• Host: GitHub
• URL: https://github.com/gabryv00/automatedreasoning-project
• Owner: GabryV00
• License: apache-2.0
• Created: 2023-06-18T14:47:42.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2023-06-18T15:08:07.000Z (almost 2 years ago)
• Last Synced: 2025-01-13T07:31:17.780Z (5 months ago)
• Topics: answer-set-programming, constraint-programming, minizinc, most-efficient-path
• Language: Python
• Homepage:
• Size: 297 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# AutomatedReasoning-Project

Modeling the most efficient path problem in MiniZinc and in Logic Programming

![testo alt](/descrizione_problema.png "Detailed description of the problem to be modeled")

## Goal of the project

The 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.

## Architecture

The project consists of the following parts:

* The *models* folder contains the model in MiniZinc and the one in Logic Programming

* The *data* folder contains 30 input instances, of varying difficulty

* The *generator.py* file generates test data instances for the models, based on the input parameters

* 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