| 2018 | FAW | A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals. | Yong Wang, Jeffrey B. Remmel |
| 2017 | LPNMR | Action Language Hybrid AL. | Alex Brik, Jeffrey B. Remmel |
| 2016 | LFCS | Index Sets for Finite Normal Predicate Logic Programs with Function Symbols. | Douglas A. Cenzer, Victor W. Marek, Jeffrey B. Remmel |
| 2015 | LPNMR | Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP. | Alex Brik, Jeffrey B. Remmel |
| 2013 | LFCS | Forward Chaining for Hybrid ASP. | Alex Brik, Jeffrey B. Remmel |
| 2013 | LFCS | Sub-computable Bounded Pseudorandomness. | Douglas Cenzer, Jeffrey B. Remmel |
| 2011 | CiE | Effective Categoricity of Injection Structures. | Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel |
| 2011 | ICLP | Hybrid ASP. | Alex Brik, Jeffrey B. Remmel |
| 2009 | CiE | S | Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel |
| 2009 | LFCS | Automata and Answer Set Programming. | Victor W. Marek, Jeffrey B. Remmel |
| 2008 | ICLP | On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP. | Victor W. Marek, Jeffrey B. Remmel |
| 2008 | ISAIM | A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs. | Douglas Cenzer, Jeffrey B. Remmel |
| 2008 | ISAIM | A Mathematician Looks at Answer Set Programming. | Jeffrey B. Remmel |
| 2008 | PODS | The chase revisited. | Alin Deutsch, Alan Nash, Jeffrey B. Remmel |
| 2007 | CiE | Untitled record | George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber |
| 2007 | LFCS | Compactness Properties for Stable Semantics of Logic Programs. | Victor W. Marek, Jeffrey B. Remmel |
| 2005 | CiE | The Complexity of Inductive Definability. | Douglas A. Cenzer, Jeffrey B. Remmel |
| 2005 | ICDT | PTIME Queries Revisited. | Alan Nash, Jeffrey B. Remmel, Victor Vianu |
| 2004 | ISAIM | Using Logic Programs to Reason about Infinite Sets. | Douglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel |
| 2004 | LPNMR | Set Constraints in Logic Programming. | V. Wiktor Marek, Jeffrey B. Remmel |
| 2001 | LPNMR | On the Expressibility of Stable Logic Programming. | V. Wiktor Marek, Jeffrey B. Remmel |
| 1999 | LPNMR | Locally Determined Logic Programs. | Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt |
| 1997 | LFCS | Basic Forward Chaining Construction for Logic Programs. | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
| 1997 | LPNMR | Non-Monotonic Reasoning with Quantified Boolean Constraints. | Ch. Pollet, Jeffrey B. Remmel |
| 1996 | LICS | On the Complexity of Abduction. | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
| 1996 | MFCS | Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract). | Jeffrey B. Remmel |
| 1995 | LICS | Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
| 1995 | LPNMR | On Logical Constraints in Logic Programming. | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
| 1992 | ICLP | The Stable Models of a Predicate Logic Program. | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
| 1992 | ICLP | Rule Systems and Well-Orderings. | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
| 1990 | LICS | A Theory of Nonmonotonic Rule Systems | V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel |
| 1989 | LICS | Polynomially Grade Logic I: A Graded Version of System T | Anil Nerode, Jeffrey B. Remmel, Andre Scedrov |