| 2000 | AIMSA | Dynamic Knowledge Representation and Its Applications. | Jos Jlio Alferes, Lus Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski, Paulo Quaresma |
| 1999 | LPNMR | LUPS - A Language for Updating Logic Programs. | Jos Jlio Alferes, Lus Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski |
| 1998 | KR | Dynamic Logic Programming. | Jos Jlio Alferes, Joo Alexandre Leite, Lus Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski |
| 1998 | KR | A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation. | Stefan Brass, Jrgen Dix, Ilkka Niemel, Teodor C. Przymusinski |
| 1996 | JELIA | Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming. | Jos Jlio Alferes, Lus Moniz Pereira, Teodor C. Przymusinski |
| 1996 | KR | Super Logic Programs. | Stefan Brass, Jrgen Dix, Teodor C. Przymusinski |
| 1995 | EPIA | Belief Revision in Non-Monotonic Reasoning. | Jos Jlio Alferes, Lus Moniz Pereira, Teodor C. Przymusinski |
| 1995 | LPNMR | Loop Checking and the Wll-Founded Semantics. | Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Strk |
| 1995 | LPNMR | Update by Means of Inference Rules. | Teodor C. Przymusinski, Hudson Turner |
| 1994 | AAAI | A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs. | Teodor C. Przymusinski |
| 1994 | GI | Semantics of Disjunctive Programs: A Unifying Approach. | Teodor C. Przymusinski |
| 1994 | JELIA | Autoepistemic Logic of Minimal Beliefs. | Teodor C. Przymusinski |
| 1992 | LPAR | Soundness and Completeness of Partial Deductions for Well-Founded Semantics. | Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki |
| 1992 | MFCS | Two Simple Characterizations of Well-Founded Semantics. | Teodor C. Przymusinski |
| 1991 | ICLP | Well-Founded Completions of Logic Programs. | Teodor C. Przymusinski |
| 1991 | LPNMR | Autoepistemic Logics of Closed Beliefs and Logic Programming. | Teodor C. Przymusinski |
| 1990 | ICLP | Extended Stable Semantics for Normal and Disjunctive Programs. | Teodor C. Przymusinski |
| 1990 | LPNMR | Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs. | Teodor C. Przymusinski |
| 1989 | ICLP | Non-Monotonic Formalisms and Logic Programming. | Teodor C. Przymusinski |
| 1989 | KR | Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming. | Teodor C. Przymusinski |
| 1989 | PODS | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. | Teodor C. Przymusinski |
| 1988 | AAAI | On the Relationship Between Logic Programming and Nonmonotonic Reasoning. | Teodor C. Przymusinski |
| 1988 | ICLP | Weakly Perfect Model Semantics for Logic Programs. | Halina Przymusinska, Teodor C. Przymusinski |
| 1988 | ICLP | Perfect Model Semantics. | Teodor C. Przymusinski |
| 1988 | ISMIS | Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics. | Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski |
| 1986 | AAAI | Query Answering in Circumscriptive and Closed-World Theories. | Teodor C. Przymusinski |
| 1986 | ISMIS | A decidable query answering algorithm for circumscriptive theories. | Teodor C. Przymusinski |
| 1986 | PODS | The Extended Closed World Assumpution and its Relationship to Parallel Circumscription. | Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski |