Mark H. Liffiton

According to our database, Mark H. Liffiton authored at least 23 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Patterns of Student Help-Seeking When Using a Large Language Model-Powered Programming Assistant.

Brad Sheese, Mark H. Liffiton, Jaromír Savelka, Paul Denny

Proceedings of the 26th Australasian Computing Education Conference, 2024

2023

Efficient Classification of Student Help Requests in Programming Courses Using Large Language Models.

Jaromír Savelka, Paul Denny, Mark H. Liffiton, Brad Sheese

CoRR, 2023

CodeHelp: Using Large Language Models with Guardrails for Scalable Support in Programming Classes.

Mark H. Liffiton, Brad E. Sheese, Jaromír Savelka, Paul Denny

Proceedings of the 23rd Koli Calling International Conference on Computing Education Research, 2023

2017

Finding Graph Decompositions via SAT.

Wenting Zhao, Mark H. Liffiton, Peter Jeavons, Dan Roberts

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016

Fast, flexible MUS enumeration.

Mark H. Liffiton, Alessandro Previti, Ammar Malik, João Marques-Silva

Constraints An Int. J., 2016

Parallelizing Partial MUS Enumeration.

Wenting Zhao, Mark H. Liffiton

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

2015

Smallest MUS Extraction with Minimal Hitting Set Dualization.

Alexey Ignatiev, Alessandro Previti, Mark H. Liffiton, João Marques-Silva

Proceedings of the Principles and Practice of Constraint Programming, 2015

2014

Trickle: Automated infeasible path detection using all minimal unsatisfiable subsets.

Bernard Blackham, Mark H. Liffiton, Gernot Heiser

Proceedings of the 20th IEEE Real-Time and Embedded Technology and Applications Symposium, 2014

2013

Iterative and core-guided MaxSAT solving: A survey and assessment.

António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, João Marques-Silva

Constraints An Int. J., 2013

Enumerating Infeasibility: Finding Multiple MUSes Quickly.

Mark H. Liffiton, Ammar Malik

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012

A Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation).

Mark H. Liffiton, Jordyn C. Maglalang

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

MaxSAT-Based MCS Enumeration.

António Morgado, Mark H. Liffiton, João Marques-Silva

Proceedings of the Hardware and Software: Verification and Testing, 2012

2009

Analyzing Infeasible Constraint Systems.

Mark H. Liffiton

PhD thesis, 2009

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.

Mark H. Liffiton, Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah

Constraints An Int. J., 2009

Generalizing Core-Guided Max-SAT.

Mark H. Liffiton, Karem A. Sakallah

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints.

Mark H. Liffiton, Karem A. Sakallah

J. Autom. Reason., 2008

Searching for Autarkies to Trim Unsatisfiable Clause Sets.

Mark H. Liffiton, Karem A. Sakallah

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Reveal: A Formal Verification Tool for Verilog Designs.

Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah

Proceedings of the Logic for Programming, 2008

2007

Improved Design Debugging Using Maximum Satisfiability.

Sean Safarpour, Hratch Mangassarian, Andreas G. Veneris, Mark H. Liffiton, Karem A. Sakallah

Proceedings of the Formal Methods in Computer-Aided Design, 7th International Conference, 2007

2006

Refinement strategies for verification methods based on datapath abstraction.

Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah

Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, 2006

2005

On Finding All Minimally Unsatisfiable Subformulas.

Mark H. Liffiton, Karem A. Sakallah

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Identifying Conflicts in Overconstrained Temporal Problems.

Mark H. Liffiton, Michael D. Moffitt, Martha E. Pollack, Karem A. Sakallah

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004

Exploiting structure in symmetry detection for CNF.

Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah, Igor L. Markov

Proceedings of the 41th Design Automation Conference, 2004