Mark H. Liffiton

26 papers A* 2A 6B 5C 1Journal 7Unranked 4
YearRankTypeTitle / Venue / Authors
2026 — conf
Focused Tutors: Assigning Custom, Targeted Chatbots to Students.
SIGCSE (2)
Mark H. Liffiton
2024 C conf
Patterns of Student Help-Seeking When Using a Large Language Model-Powered Programming Assistant.
ACE
Brad Sheese, Mark H. Liffiton, Jaromír Savelka, Paul Denny
2023 — conf
CodeHelp: Using Large Language Models with Guardrails for Scalable Support in Programming Classes.
Koli Calling
Mark H. Liffiton, Brad E. Sheese, Jaromír Savelka, Paul Denny
2023 J jnl
CodeHelp: Using Large Language Models with Guardrails for Scalable Support in Programming Classes.
CoRR
Mark H. Liffiton, Brad Sheese, Jaromír Savelka, Paul Denny
2023 J jnl
Efficient Classification of Student Help Requests in Programming Courses Using Large Language Models.
CoRR
Jaromír Savelka, Paul Denny, Mark H. Liffiton, Brad Sheese
2023 J jnl
Patterns of Student Help-Seeking When Using a Large Language Model-Powered Programming Assistant.
CoRR
Brad Sheese, Mark H. Liffiton, Jaromír Savelka, Paul Denny
2017 B conf
Finding Graph Decompositions via SAT.
ICTAI
Wenting Zhao, Mark H. Liffiton, Peter Jeavons, Dan Roberts
2016 J jnl
Fast, flexible MUS enumeration.
Constraints An Int. J.
Mark H. Liffiton, Alessandro Previti, Ammar Malik, João Marques-Silva
2016 B conf
Parallelizing Partial MUS Enumeration.
ICTAI
Wenting Zhao, Mark H. Liffiton
2015 A conf
Smallest MUS Extraction with Minimal Hitting Set Dualization.
CP
Alexey Ignatiev, Alessandro Previti, Mark H. Liffiton, João Marques-Silva
2014 A conf
Trickle: Automated infeasible path detection using all minimal unsatisfiable subsets.
RTAS
Bernard Blackham, Mark H. Liffiton, Gernot Heiser
2013 B conf
Enumerating Infeasibility: Finding Multiple MUSes Quickly.
CPAIOR
Mark H. Liffiton, Ammar Malik
2013 J jnl
Iterative and core-guided MaxSAT solving: A survey and assessment.
Constraints An Int. J.
António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, João Marques-Silva
2012 A conf
A Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation).
SAT
Mark H. Liffiton, Jordyn C. Maglalang
2012 — conf
MaxSAT-Based MCS Enumeration.
Haifa Verification Conference
António Morgado, Mark H. Liffiton, João Marques-Silva
2009 J jnl
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.
Constraints An Int. J.
Mark H. Liffiton, Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah
2009 — —
Analyzing Infeasible Constraint Systems.
Mark H. Liffiton
2009 A conf
Generalizing Core-Guided Max-SAT.
SAT
Mark H. Liffiton, Karem A. Sakallah
2008 J jnl
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints.
J. Autom. Reason.
Mark H. Liffiton, Karem A. Sakallah
2008 B conf
Reveal: A Formal Verification Tool for Verilog Designs.
LPAR
Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah
2008 A conf
Searching for Autarkies to Trim Unsatisfiable Clause Sets.
SAT
Mark H. Liffiton, Karem A. Sakallah
2007 B conf
Improved Design Debugging Using Maximum Satisfiability.
FMCAD
Sean Safarpour, Hratch Mangassarian, Andreas G. Veneris, Mark H. Liffiton, Karem A. Sakallah
2006 — conf
Refinement strategies for verification methods based on datapath abstraction.
ASP-DAC
Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah
2005 A* conf
Identifying Conflicts in Overconstrained Temporal Problems.
IJCAI
Mark H. Liffiton, Michael D. Moffitt, Martha E. Pollack, Karem A. Sakallah
2005 A conf
On Finding All Minimally Unsatisfiable Subformulas.
SAT
Mark H. Liffiton, Karem A. Sakallah
2004 A* conf
Exploiting structure in symmetry detection for CNF.
DAC
Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah, Igor L. Markov