Lecturer at LFCS, School of Informatics, University of Edinburgh.
PhD in Mathematics (Universidad de Buenos Aires) and Computer Science (Université Sorbonne Paris Nord).
Research interests
- Knowledge Representation and Reasoning
- Computational Logic
- Database Theory
- Graph Theory and Computational Complexity
Academic profiles: DBLP · Google Scholar · ResearchGate · LinkedIn.
And now, for something completely different... Check out my band Polandria: Bandcamp · Spotify.
News
Oct 2026:
- Paper accepted in CSL 2027.
- PC Member of the Workshop on Foundations of Neuro-Symbolic Logical Reasoning (FOUSY).
Sep 2026:
- Paper accepted in International Joint Conference on Knowledge Graphs (IJCKG). Invited to the conference's Special Issue of New Generation Computing (Springer).
Aug 2026:
- Paper accepted in Discrete Applied Mathematics (DAM).
- Invited tutorial at Reasoning Web Summer School, 27-30 August, Vilnius, Lithuania.
Jul 2026:
- Paper accepted in LINDA Workshop co-located with KR 2026, 24 July, Lisbon, Portugal.
- Dagstuhl seminar KR Meets XAI: Bridging Symbolic and Neuro-Symbolic AI for True Explainability, 5-10 July, Dagstuhl, Germany.
Jun 2026:
- Paper accepted in RuleML+RR, 24-26 August, Vilnius, Lithuania. Invited to the conference's Special Issue of Transactions on Graph Data and Knowledge (Dagstuhl publishing).
- Paper accepted in Transactions on Graph Data and Knowledge (TKDG).
May 2026:
Mar 2026:
- Felipe Azúa Zagal starts as a PhD student at the School of Informatics under my supervision.
Feb 2026:
- PC Member of KR 2026.
- Awarded the status of Fellow of Higher Education Academy (FHEA).
Older news
Dec 2025:
- Invited speaker at Christmas Seminar of the Midlands Graduate School, 16 December, Birmingham, UK.
Jul 2025:
- Paper and other paper accepted in LAGOS 2025, 10-14 November, Buenos Aires, Argentina.
- Paper accepted in IRIS-AI, 1–4 August 2025, Montefiascone, Italy.
- Paper accepted in KR 2025, 11-17 November, Melbourne, Australia.
Jun 2025:
Mar 2025:
- Paper accepted in PODS 2025, 22-27 June, Berlin, Germany.
- Workshop "Foundations and Future of Change in Artificial Intelligence" accepted for ECAI 2025.
- Visit and talk at the RATIO team's seminar, LaBRI, Université de Bordeaux, France.
Feb 2025:
- Dagstuhl seminar Semirings in Databases, Automata, and Logic, 16-21 February 2025, Dagstuhl, Germany.
Jan 2025:
- Visit and talk at the Explainable AI seminar, CLArg Group, Imperial College London, UK.
- PC Member of JELIA 2025 and FoIKS 2026.
Dec 2024:
- Talk at the Links team seminar, CRIStAL, Université de Lille, France.
Oct 2024:
- Project titled "Database Repairs, Consistent Answers, and Semirings” accepted in Research-in-Groups programme of the International Centre for Mathematical Sciences (ICMS) in Edinburgh; co-applied with J. Virtema and P. Kolaitis.
Sep 2024:
- Paper accepted in Discrete Mathematics.
Jul 2024:
- Paper accepted to ECAI 2024, 21-24 October, Santiago de Compostela, Spain.
- PC Member of AMW 2024.
- Women in Logic (affiliated with ICALP-FSCD-LICS), 9th July 2024, Tallinn, Estonia.
Mar 2024:
- 6th Madeira Workshop on Belief Revision, Argumentation, Ontologies, and Norms (BRAON), 21-25 March 2024, Madeira, Portugal.
- Dagstuhl seminar Logics for Dependence and Independence: Expressivity and Complexity, 10-15 March 2024, Dagstuhl, Germany.
- Dagstuhl seminar Shapes in Graph Data: Theory and Implementation, 3-8 March 2024, Dagstuhl, Germany.
Feb 2024:
Publications
Peer-reviewed
- Local consistency and axioms of functional dependence. T. Barlag, M. Hannula, J. Kontinen, N. Pardal, J. Virtema. CSL 2027.
- From DL-LiteR to TGDs and back: A tight graph-based characterisation. G. Konstantinidis, N. Pardal. IJCKG 2026.
- A characterization of interval nest digraphs. A. Alcantar, F. Bonomo-Braberman, G. Duran, N. Pardal. Discrete Applied Mathematics 395, 337--344, 2026.
- How human-centric are our graph data abstractions?. A. Bonifati, A. Dimou, S. Dumbrava, G. Fletcher, K. Hose, G. Konstantinidis, J.E. Labra-Gayo, W. Martens, N. Pardal, L. Peterfreund, K. Thornton, M.E. Vidal, H. Voigt. Vol. 4, Issue 2, Transactions on Graph Data and Knowledge, 2026.
- Sufficient Explanations in Databases and their Connections to Database Repairs. L. Bertossi, N. Pardal. RuleML+RR, 2026.
- On the generic information capacity of relational schemas with a single binary relation. B. Groz, J. Hidders, N. Pardal, J. Van den Bussche, P. Wieczorek. To appear in Proceedings of ICDT 2027.
- A local perspective on inconsistency in data-graphs. N. Pardal, M.V. Martinez. In LINDA Workshop, co-located with KR and FLOC, 2026.
- Trees with proper thinness 2. F. Bonomo-Braberman, I. Maqueda, N. Pardal. Vol 273, 501-508, Procedia Computer Science 2025 (Proceedings from LAGOS 2025).
- Exploring subgraph complementation to bounded-degree graphs. I. Koch, N. Pardal, V.F. dos Santos. Vol 273, 239-246, Procedia Computer Science 2025 (Proceedings from LAGOS 2025).
- The KG-ER Conceptual Schema Language. E. Franconi, B. Groz, J. Hidders, N. Pardal, S. Staworko, J. Van den Bussche, P. Wieczorek. In Proceedings of IRIS-AI 2025.
- A logic-based framework for database repairs. N. Fröhlich, A. Meier, N. Pardal, J. Virtema. KR 2025.
- Assessing the Feasibility of Predicting Social Network Users' Behaviour Using Linguistic and Social Cues. S. Malvicini, L. Alonso Alemany, N. Pardal, M.V.Martinez, G. Simari. 27th International Congress of the Catalan Association for Artificial Intelligence (CCIA) 2025.
- Rewriting Consistent Answers on Annotated Data. P. Kolaitis, N. Pardal, J. Virtema, J. Wijsen. PODS 2025.
- On the proper interval completion problem within some chordal subclasses. F. Dross, C. Hilaire, I. Koch, V. Leoni, N. Pardal, M. I. L. Pujato, V.F. dos Santos. Discrete Mathematics, Vol. 348/1, 114274, 2025.
- The Distributional Uncertainty of the SHAP score in Explainable Machine Learning. S. Cifuentes, L. Bertossi, N. Pardal, S. Abriola, M.V. Martinez, M. Romero. ECAI 2024.
- Edge deletion on tree-like graph classes. I. Koch, N. Pardal, V.F. dos Santos. Discrete Applied Mathematics, Vol. 348, 122–131, 2024.
- An epistemic approach to model uncertainty in data-graphs. S. Abriola, S. Cifuentes, M. V. Martínez, N. Pardal, E. Pin. International Journal of Approximate Reasoning (IJAR), Volume 160, 108948, 2023.
- Unified foundations for team semantics via semirings. T. Barlag, M. Hannula, J. Kontinen, N. Pardal, J. Virtema. In Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning — Main Track, 75–85, 2023.
- Data-graph repairs: the preferred approach. S. Abriola, S. Cifuentes, N. Pardal, E. Pin. In CEUR Workshop Proceedings, Vol. 3409, Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW), 2023.
- On the complexity of finding set repairs for data-graphs. S. Abriola, S. Cifuentes, M. V. Martínez, N. Pardal, E. Pin. Journal of Artificial Intelligence Research (JAIR), Vol. 76, 721–759, 2023.
- 2-nested matrices: towards understanding the structure of circle graphs. G. A. Durán, N. Pardal, M. D. Safe. Graphs and Combinatorics, 38:111, 2022.
- Forbidden induced subgraph characterization of circle graphs within split graphs. F. Bonomo-Braberman, G. A. Durán, N. Pardal, M. D. Safe. Discrete Applied Mathematics, Vol. 323, Issue C, 43–75, 2020.
- On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs N. Pardal, G. A. Durán, L. Grippo, M. D. Safe. Matemática Contemporânea 46, 119–128, 2019.
Preprints
- Exploring the Boundaries of Tractable Consistent Answers in Data-Graphs. E. Pin, S. Abriola, S. Cifuentes, M. V. Martínez, N. Pardal. 2026.
- Computational Complexity of Preferred Subset Repairs on Data-Graphs. N. Pardal, S. Cifuentes, E. Pin, M. V. Martínez, S. Abriola. 2024.
PhD opportunities
I currently don't have any PhD funding to offer. If you are interested in pursuing a PhD in Edinburgh, please first read the School's application guidance and its advice on finding a supervisor. If you decide to apply and think your proposed research aligns with my work, please send me a brief email explaining the fit.
PhD funding at Edinburgh
The School of Informatics and the University advertise competitive PhD studentships through their own schemes. Some schemes require support from a prospective supervisor. I may support a funding application when the proposed research is a close fit with my work and the candidate has a strong academic record and relevant research experience. My support cannot guarantee a funding award, and an offer of admission does not itself confirm that funding has been awarded.
I will consider candidates applying for advertised funded studentships or holding confirmed external scholarships or grants. I do not consider self-funded PhD applications. Please check current opportunities, eligibility and deadlines directly: