Alessandro Bertagnon

Orcid: 0000-0003-2390-0629

According to our database1, Alessandro Bertagnon authored at least 16 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
New encodings of the (Euclidean) travelling salesperson problem in constraint answer set programming on difference logic.
J. Log. Comput., 2026

2025
Fine-Grained Timing Analysis of Digital Integrated Circuits in Answer Set Programming.
Theory Pract. Log. Program., 2025

An Autonomous Robotic System for Aorta Ultrasound Screening with Deep Learning Segmentation.
Proceedings of the 21st IEEE International Conference on Automation Science and Engineering, 2025

2024
ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex.
J. Log. Comput., 2024

Geometric reasoning on the euclidean traveling salesperson problem in answer set programming<sup>1</sup>.
Intelligenza Artificiale, 2024

Stronger integration of circuit and alldifferent propagators for the Hamiltonian Cycle Problem.
Proceedings of the International Workshop on Artificial Intelligence for Climate Change, 2024

2023
Geometric reasoning on the Traveling Salesperson Problem: comparing Answer Set Programming and Constraint Logic Programming Approaches.
Proceedings of the International Conference on Logic Programming 2023 Workshops co-located with the 39th International Conference on Logic Programming (ICLP 2023), 2023

ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex.
Proceedings of the 38th Italian Conference on Computational Logic, 2023

2022
Improving Reasoning in Constraint Logic Programming: an Application to Route Planning and Qualitative Temporal Reasoning Problems.
PhD thesis, 2022

Comparing Emotion and Sentiment Analysis Tools on Italian anti-vaccination for COVID-19 posts.
Proceedings of the Sixth Workshop on Natural Language for Artificial Intelligence (NL4AI 2022) co-located with 21th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2022), 2022

2021
Branching interval algebra: An almost complete picture.
Inf. Comput., 2021

2020
Constraint Programming Algorithms for Route Planning Exploiting Geometrical Information.
Proceedings of the Proceedings 36th International Conference on Logic Programming (Technical Communications), 2020

The Horn Fragment of Branching Algebra.
Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, 2020

On (Maximal, Tractable) Fragments of the Branching Algebra.
Proceedings of the 35th Italian Conference on Computational Logic, 2020

Improving the Efficiency of Euclidean TSP Solving in Constraint Programming by Predicting Effective Nocrossing Constraints.
Proceedings of the Joint Proceedings of the 8th Italian Workshop on Planning and Scheduling and the 27th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion co-located with AIxIA 2020, 2020

Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD).
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020


  Loading...