default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark H. Liffiton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Brad Sheese
, Mark H. Liffiton, Jaromír Savelka, Paul Denny:
Patterns of Student Help-Seeking When Using a Large Language Model-Powered Programming Assistant. ACE 2024: 49-57- 2023
- [c16]Mark H. Liffiton, Brad E. Sheese, Jaromír Savelka, Paul Denny:
CodeHelp: Using Large Language Models with Guardrails for Scalable Support in Programming Classes. Koli Calling 2023: 8:1-8:11 - [i3]Mark H. Liffiton, Brad Sheese, Jaromír Savelka, Paul Denny:
CodeHelp: Using Large Language Models with Guardrails for Scalable Support in Programming Classes. CoRR abs/2308.06921 (2023) - [i2]Brad Sheese, Mark H. Liffiton, Jaromír Savelka, Paul Denny:
Patterns of Student Help-Seeking When Using a Large Language Model-Powered Programming Assistant. CoRR abs/2310.16984 (2023) - [i1]Jaromír Savelka, Paul Denny, Mark H. Liffiton, Brad Sheese:
Efficient Classification of Student Help Requests in Programming Courses Using Large Language Models. CoRR abs/2310.20105 (2023)
2010 – 2019
- 2017
- [c15]Wenting Zhao, Mark H. Liffiton, Peter Jeavons, Dan Roberts:
Finding Graph Decompositions via SAT. ICTAI 2017: 131-138 - 2016
- [j4]Mark H. Liffiton, Alessandro Previti, Ammar Malik, João Marques-Silva:
Fast, flexible MUS enumeration. Constraints An Int. J. 21(2): 223-250 (2016) - [c14]Wenting Zhao, Mark H. Liffiton:
Parallelizing Partial MUS Enumeration. ICTAI 2016: 464-471 - 2015
- [c13]Alexey Ignatiev, Alessandro Previti, Mark H. Liffiton, João Marques-Silva:
Smallest MUS Extraction with Minimal Hitting Set Dualization. CP 2015: 173-182 - 2014
- [c12]Bernard Blackham, Mark H. Liffiton, Gernot Heiser:
Trickle: Automated infeasible path detection using all minimal unsatisfiable subsets. RTAS 2014: 169-178 - 2013
- [j3]António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, João Marques-Silva:
Iterative and core-guided MaxSAT solving: A survey and assessment. Constraints An Int. J. 18(4): 478-534 (2013) - [c11]Mark H. Liffiton, Ammar Malik:
Enumerating Infeasibility: Finding Multiple MUSes Quickly. CPAIOR 2013: 160-175 - 2012
- [c10]António Morgado, Mark H. Liffiton, João Marques-Silva:
MaxSAT-Based MCS Enumeration. Haifa Verification Conference 2012: 86-101 - [c9]Mark H. Liffiton, Jordyn C. Maglalang:
A Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation). SAT 2012: 485-486
2000 – 2009
- 2009
- [b1]Mark H. Liffiton:
Analyzing Infeasible Constraint Systems. University of Michigan, USA, 2009 - [j2]Mark H. Liffiton, Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah:
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints An Int. J. 14(4): 415-442 (2009) - [c8]Mark H. Liffiton, Karem A. Sakallah:
Generalizing Core-Guided Max-SAT. SAT 2009: 481-494 - 2008
- [j1]Mark H. Liffiton, Karem A. Sakallah:
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints. J. Autom. Reason. 40(1): 1-33 (2008) - [c7]Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah:
Reveal: A Formal Verification Tool for Verilog Designs. LPAR 2008: 343-352 - [c6]Mark H. Liffiton, Karem A. Sakallah:
Searching for Autarkies to Trim Unsatisfiable Clause Sets. SAT 2008: 182-195 - 2007
- [c5]Sean Safarpour, Hratch Mangassarian, Andreas G. Veneris, Mark H. Liffiton, Karem A. Sakallah:
Improved Design Debugging Using Maximum Satisfiability. FMCAD 2007: 13-19 - 2006
- [c4]Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah:
Refinement strategies for verification methods based on datapath abstraction. ASP-DAC 2006: 19-24 - 2005
- [c3]Mark H. Liffiton, Michael D. Moffitt, Martha E. Pollack, Karem A. Sakallah:
Identifying Conflicts in Overconstrained Temporal Problems. IJCAI 2005: 205-211 - [c2]Mark H. Liffiton, Karem A. Sakallah:
On Finding All Minimally Unsatisfiable Subformulas. SAT 2005: 173-186 - 2004
- [c1]Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah, Igor L. Markov:
Exploiting structure in symmetry detection for CNF. DAC 2004: 530-534
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
