Uma abordagem inicial em answer set programming para o problema de programação de tripulação

Abstract

Answer Set Programming is an declarative approach used to solve problems. It has roots in logical programming, a programming paradigm that states rules and goals it wants to achieve, instead of a squence of actions that leads to the goal. The main difference from ASP to the other languages of the logical paradigm is that ASP use solvers that return answer sets that satisfy the model restrictions, if they exist. This work shows the inicial implementation of an ASP approach, to resolve the Crew Scheduling Problem. An analysis of the approach is presented, focusing in the advantages and disadvantages of using this logical approach to the problem. The results obtained by the analysis show that an Integer Linear Programming approach is more efficient than ASP, although the latter represents a more understandable modeling.