Conference proceedings and presentations by the Computer Science Department faculty members are collected here.
Submissions from 2022
The 10th Annual Computer Science Workshop, Submissions, Abstract Template, Computer Science Department
Submissions from 2020
The 10th Annual Computer Science Workshop, Submissions, Abstract Template, Computer Science Department
Submissions from 2019
Using the SOLO Taxonomy to Understand Subgoal Labels Effect in CS1, Adrienne Decker, Lauren E. Margulieux, and Briana B. Morrison
Submissions from 2017
Dual Modality Code Explanations for Novices: Unexpected Results, Briana B. Morrison
Submissions from 2016
Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter, Marcello Balduccini and Yuliya Lierler
Constraint CNF: SAT and CSP Language Under One Roof, Broes De Cat and Yuliya Lierler
Information Seeking Practices of Parents: Exploring Skills, Face Threats and Social Networks, Betsy DiSalvo, Parisa Khanipour Roshan, and Briana B. Morrison
First-Order Modular Logic programs and their Conservative Extensions, Amelia Harrison and Yuliya Lierler
Constraint Answer Set Programming versus Satisfiability Modulo Theories, Yuliya Lierler and Benjamin Susman
Learning Loops: A Replication Study Illuminates Impact of HS Courses, Briana B. Morrison, Adrienne Decker, and Lauren E. Margulieux
A Dynamic Run-Profile Energy-Aware Approach for Scheduling Computationally Intensive Bioinformatics Applications, Sachin Pawaskar and Hesham Ali
SMT-based Constraint Answer Set Solver EZSMT (System Description), Benjamin Susman and Yuliya Lierler
Submissions from 2015
The Winograd Schema Challenge and Reasoning about Correlation, Dan Bailey, Amelia Harrison, Yuliya Lierler, Vladimir Lifschitz, and Julian Michael
Prepositional Phrase Attachment Problem Revisited: How VERBNET Can Help, Dan Bailey, Yuliya Lierler, and Benjamin Susman
Performance Tuning in Answer Set Programming, Matt Buddenhagen and Yuliya Lierler
Usability and Usage of Interactive Features in an Online Ebook for CS Teachers, Barbara Ericson, Steven Moore, Briana B. Morrison, and Mark Guzdial
An Abstract View on Modularity in Knowledge Representation, Yuliya Lierler and Miroslaw Truszczyński
Subgoals Help Students Solve Parsons Problems, Briana B. Morrison, Lauren E. Margulieux, Barbara Ericson, and Mark Guzdial
Subgoals, Context, and Worked Examples in Learning Computing Problem Solving, Briana B. Morrison, Lauren E. Margulieux, and Mark Guzdial
Submissions from 2014
Abstract Disjunctive Answer Set Solvers, Remi Brochenin, Yuliya Lierler, and Marco Maratea
Abstract Modular Inference Systems and Solvers, Yuliya Lierler and Miroslaw Truszczyński
Submissions from 2013
Hybrid Automated Reasoning Tools: from Black-box to Clear-box Integration, Marcello Balduccini and Yuliya Lierler
Prolog and ASP Inference Under One Roof, Marcello Balduccini, Yuliya Lierler, and Peter Schüller
A Critique of “Gamification” in Khan Academy, Betsy DiSalvo and Briana B. Morrison
Logic Programs vs. First-Order Formulas in Textual Inference, Yuliya Lierler and Vladimir Lifschitz
Towards a Tight Integration of Syntactic Parsing with Semantic Disambiguation by means of Declarative Programming, Yuliya Lierler and Peter Schüller
Abstract Modular Systems and Solvers, Yuliya Lierler and Miroslaw Truszczyński
Modular Answer Set Solving, Yuliya Lierler and Miroslaw Truszczyński
Research Challenges and Opportunities in Knowledge Representation, Section 2.3.2: Applications based on formal models, Natasha Noy, Deborah McGuinness, and Yuliya Lierler
Research Challenges and Opportunities in Knowledge Representation, Section 2.4.2 Advances in satisfiability and answer set programming, Natasha Noy, Deborah McGuinness, and Yuliya Lierler
Research Challenges and Opportunities in Knowledge Representation, Section 4.1.1 Hybrid KR, Natasha Noy, Deborah McGuinness, and Yuliya Lierler
Submissions from 2012
Practical and Methodological Aspects of the Use of Cutting-Edge ASP Tools, Marcello Balduccini and Yuliya Lierler
A Tarskian Informal Semantics for Answer Set Programming, Marc Denecker, Yuliya Lierler, Miroslaw Truszczyński, and Joost Vennekens
On the Relation of Constraint Answer Set Programming Languages and Algorithms, Yuliya Lierler
Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving, Yuliya Lierler and Shaden Smith
Surviving Solver Sensitivity: An ASP Practitioner’s Guide, Bryan Silverthorn, Yuliya Lierler, and Marius Schneider
An Energy-Aware Bioinformatics Application for Assembling Short Reads in High Performance Computing Systems, Julia Warnke, Sachin Pawaskar, and Hesham Ali
Submissions from 2011
ASP-Based Problem Solving with Cutting-Edge Tools, Marcello Balduccini and Yuliya Lierler
Termination of Grounding is Not Preserved by Strongly Equivalent Transformations, Yuliya Lierler and Vladimir Lifschitz
Parsing Combinatory Categorial Grammar with Answer Set Programming: Preliminary Report, Yuliya Lierler and Peter Schüller
Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving, Yuliya Lierler, Shaden Smith, Miroslaw Truszczyński, and Alex Westlund
A transition system for AC language algorithms, Yuliya Lierler and Yaunlin Zhang
Submissions from 2010
Representing Synonymity in Causal Logic and in Logic Programming, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz, and Fangkai Yang
A Dynamic Energy-Aware Model for Scheduling Computationally Intensive Bioinformatics Applications, Sachin Pawaskar and Hesham Ali
Submissions from 2009
One More Decidable Class of Finitely Ground Programs, Yuliya Lierler and Vladimir Lifschitz
Submissions from 2008
Abstract Answer Set Solvers, Yuliya Lierler
Dynamic Energy Aware Task Scheduling for Periodic Tasks using Expected Execution Time Feedback, Sachin Pawaskar and Hesham Ali
On the Tradeoff between Speedup and Energy Consumption in High Performance Computing – A Bioinformatics Case Study, Sachin Pawaskar and Hesham Ali
Submissions from 2007
Head-Elementary-Set-Free Logic Programs, Martin Gebser, Joohyung Lee, and Yuliya Lierler
Dynamic Energy Aware Task Scheduling using Run-Queue Peek, Sachin Pawaskar and Hesham Ali
Submissions from 2006
Elementary Sets for Logic Programs, Martin Gebser, Joohyung Lee, and Yuliya Lierler
Experiments with SAT-based Answer Set Programming, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea, and A. Tacchella
Model Generation for Generalized Quantifiers via Answer Set Programming, Yuliya Lierler and Günther Görz
Submissions from 2005
Cmodels for Tight Disjunctive Logic Programs, Yuliya Lierler
CMODELS – SAT-based Disjunctive Answer Set Solver, Yuliya Lierler
Disjunctive Answer Set Programming via Satisfiability, Yuliya Lierler
Submissions from 2004
Automatic Compilation of Protocol Insecurity Problems into Logic Programming, Alessandro Armondo, Luca Compagna, and Yuliya Lierler
SAT-Based Answer Set Programming, Enrico Giunchiglia, Yuliya Lierler, and Marco Maratea
A SAT-Based Polynomial Space Algorithm for Answer Set Programming, Enrico Giunchiglia, Marco Maratea, and Yuliya Lierler
Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs, Yuliya Lierler and Marco Maratea
When Are Behaviour Networks Well-Behaved?, Bernhard Nebel and Yuliya Lierler
A Maximal Chain Approach for Scheduling Tasks in a Multiprocessor Systems, Sachin Pawaskar and Hesham Ali
Submissions from 2003
Computing Answer Sets of a Logic Program via-enumeration of SAT certificates, Yuliya Lierler and Marco Maratea
Goal-Converging Behavior Networks and Self-Solving Planning Domains, Bernhard Nebel and Yuliya Lierler
Submissions from 2002
Ventures into Capturing Effort in Programming, Barbara Bernal-Thomas and Briana B. Morrison
Submissions from 2000
Fages' Theorem and Answer Set Programming, Yuliya Lierler, Esta Erdem, and Vladimir Lifschitz