📄📄📄 3 Papers accepted @ FLoC 2026!! 🎉🎉🎉
Excited to share that three of our papers have been accepted at FLoC 2026, covering automated feedback for Prolog education, data-driven mutation testing for Prolog, and …
Solving MaxSAT Problems from Natural Language Descriptions with LLMs and PySAT
In this paper, we study a neuro-symbolic approach in which an LLM translates a natural language description of an optimisation problem into executable Python code using PySAT. The …
Counterexample Guided Program Repair Using Large Language Models and MaxSAT-based Fault Localization @ IIIA-CSIC
In this talk I will present a hybrid method to automated repair of C code, using Maximum Satisfiability (MaxSAT)-based fault localization, CFaults, to localize bugs and LLMs to …
MENTOR: Automated Feedback for Introductory Programming Exercises @ FCT-UNL
In my talk, I will present MENTOR, a semantic automated program repair (APR) framework designed to provide Automated Feedback for Introductory Programming Exercises.
Counterexample Guided Program Repair Using Zero-Shot Learning and MaxSAT-based Fault Localization @ OutSystems
In this talk I will present our novel approach that combines the strengths of both FM-based fault localization and LLMs, via zero-shot learning, to enhance Automated Program …
LLM-Driven Automated Program Repair Using MaxSAT-based Fault Localization @ Oxford
In this talk I will present a hybrid method to automated repair of C code, using Maximum Satisfiability (MaxSAT)-based fault localization, CFaults, to localize bugs and LLMs to …
User partitioning for Maximum Satisfiability
The Maximum Satisfiability (MaxSAT) problem is the optimisation variant of the Satisfiability (SAT) problem. Solving MaxSAT efficiently often involves partitioning the set of soft …
UpMax: User partitioning for MaxSAT @ SAT 2023
In this talk I will present a new framework called UpMax that decouples the partitioning procedure from the MaxSAT solving algorithms.
UpMax: User partitioning for MaxSAT
This paper proposes a new framework called UpMax that decouples the partitioning procedure from the MaxSAT solving algorithms. As a result, new partitioning procedures can be …
AlloyMax: Bringing Maximum Satisfaction to Relational Specifications
We propose AlloyMax, an extension of Alloy with a capability to express and analyze problems with optimal solutions. AlloyMax introduces (1) a small addition of language constructs …
Changjian Zhang
•
•
1 min read