A Decidable Class of Groundable Formulas in the General Theory of Stable Models. - Michael Bartholomew; Joohyung Lee 002 (KR, 2010)

First-Order Semantics of Aggregates in Answer Set Programming Via Modified Circumscription. - Michael Bartholomew; Joohyung Lee 002; Yunsong Meng (AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning, 2011)

First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription. - Michael Bartholomew; Joohyung Lee 002; Yunsong Meng (IJCAI, 2011)

Stable Models of Formulas with Intensional Functions. - Michael Bartholomew; Joohyung Lee 002 (KR, 2012)

Functional Stable Model Semantics and Answer Set Programming Modulo Theories. - Michael Bartholomew; Joohyung Lee 002 (IJCAI, 2013)

A Functional View of Strong Negation in Answer Set Programming. - Michael Bartholomew; Joohyung Lee 002 (CoRR, 2013)

The Role of Functions in the Stable Model Semantics. - Michael Bartholomew (Theory Pract. Log. Program., 2013)

On the stable model semantics for intensional functions. - Michael Bartholomew; Joohyung Lee 002 (Theory Pract. Log. Program., 2013)

System aspmt2smt: Computing ASPMT Theories by SMT Solvers. - Michael Bartholomew; Joohyung Lee 002 (JELIA, 2014)

Stable Models of Multi-Valued Formulas: Partial versus Total Functions. - Michael Bartholomew; Joohyung Lee 002 (KR, 2014)

Answer Set Programming Modulo Theories. - Michael Bartholomew (2016)

First-order stable model semantics with intensional functions. - Michael Bartholomew; Joohyung Lee 002 (Artif. Intell., 2019)

System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers. - Michael Bartholomew; Joohyung Lee 002 (CoRR, 2025)