| Publication | Date of Publication | Type |
|---|
| Calculational proofs | 2024-10-28 | Paper |
| On Heuer's procedure for verifying strong equivalence | 2024-05-29 | Paper |
| Here and There with Arithmetic | 2023-12-12 | Paper |
| Towards Verifying Logic Programs in the Input Language of clingo | 2022-11-09 | Paper |
| Strong Equivalence of Logic Programs with Counting | 2022-09-30 | Paper |
| Loop checking and the well-founded semantics | 2022-08-30 | Paper |
| Transforming gringo rules into formulas in a natural way | 2021-12-01 | Paper |
| Verifying Tight Logic Programs with anthem and vampire | 2020-12-13 | Paper |
| Relating Two Dialects of Answer Set Programming | 2020-05-04 | Paper |
| Intelligent Instantiation and Supersafe Rules | 2019-10-24 | Paper |
| Verifying strong equivalence of programs in the input language of \textsc{gringo} | 2019-10-10 | Paper |
| Answer Set Programming | 2019-08-22 | Paper |
| Functional completion | 2018-08-28 | Paper |
| Abstract gringo | 2017-11-09 | Paper |
| On equivalence of infinitary formulas under the stable model semantics | 2017-11-09 | Paper |
| Stable models for infinitary formulas with extensional atoms | 2017-11-09 | Paper |
| Proving infinitary formulas | 2017-11-09 | Paper |
| Achievements in answer set programming | 2017-11-08 | Paper |
| Program completion in the input language of GRINGO | 2017-11-08 | Paper |
| Why are there so many loop formulas? | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740447 | 2016-07-26 | Paper |
| In memoriam: Grigori E. Mints (1939--2014) | 2016-03-21 | Paper |
| The dramatic true story of the frame default | 2015-04-23 | Paper |
| Lloyd-Topor completion and general stable models | 2014-02-27 | Paper |
| Two-Valued Logic Programs | 2014-02-25 | Paper |
| Obituary: Nikolai Aleksandrovich Shanin (1919--2011) | 2013-12-17 | Paper |
| On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics | 2013-10-10 | Paper |
| Relational theories with null values and non-herbrand stable models | 2013-03-13 | Paper |
| Representing first-order causal theories by logic programs | 2012-08-30 | Paper |
| Yet another characterization of strong equivalence | 2012-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3007261 | 2011-06-21 | Paper |
| Stable models and circumscription | 2011-06-17 | Paper |
| Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations | 2011-05-26 | Paper |
| On the Minimality of Stable Models | 2011-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2996265 | 2011-05-06 | Paper |
| Translating First-Order Causal Theories into Answer Set Programming | 2010-10-01 | Paper |
| Thirteen Definitions of a Stable Model | 2010-09-03 | Paper |
| Logic Programming | 2009-08-06 | Paper |
| One More Decidable Class of Finitely Ground Programs | 2009-07-24 | Paper |
| Safe Formulas in the General Theory of Stable Models (Preliminary Report) | 2009-01-22 | Paper |
| Twelve Definitions of a Stable Model | 2009-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5426204 | 2007-11-16 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2007-11-07 | Paper |
| A generalization of the Lin-Zhao theorem | 2006-12-20 | Paper |
| Temporal phylogenetic networks and logic programming | 2006-08-28 | Paper |
| Nonmonotonic causal theories | 2006-02-07 | Paper |
| Representing the Zoo World and the Traffic World in the language of the Causal Calculator | 2006-02-07 | Paper |
| Weight constraints as nested expressions | 2005-04-29 | Paper |
| Tight logic programs | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736516 | 2004-08-09 | Paper |
| Nikolai Aleksandrovich Shanin (on his 80th birthday) | 2003-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415103 | 2003-07-28 | Paper |
| Nested abnormality theories | 2003-02-04 | Paper |
| Answer set programming and plan generation | 2002-07-15 | Paper |
| On calculational proofs | 2002-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4702576 | 2002-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767107 | 2002-01-28 | Paper |
| Getting to the airport: The oldest planning problem in AI | 2001-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4514010 | 2000-11-19 | Paper |
| Nested expressions in logic programs | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955331 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955332 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934651 | 2000-03-22 | Paper |
| On the logic of causal explanation | 1998-08-13 | Paper |
| Representing action: indeterminacy and ramifications | 1998-06-30 | Paper |
| Two components of an action language | 1998-06-09 | Paper |
| ECWA made easy | 1997-01-14 | Paper |
| Minimal belief and negation as failure | 1995-09-11 | Paper |
| Representing action and change by logic programs | 1994-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028795 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028811 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4012230 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983043 | 1992-06-26 | Paper |
| Frames in the space of situations | 1992-06-25 | Paper |
| Circumscriptive theories: A logic-based framework for knowledge representation | 1992-06-25 | Paper |
| What is the inverse method? | 1989-01-01 | Paper |
| Miracles in formal theories of action | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3486550 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830545 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3198886 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830556 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750390 | 1988-01-01 | Paper |
| On the satisfiability of circumscription | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3749038 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3744159 | 1985-01-01 | Paper |
| Closed-world databases and circumscription | 1985-01-01 | Paper |
| On verification of programs with goto statements | 1984-01-01 | Paper |
| A note on the complexity of a partition algorithm | 1983-01-01 | Paper |
| The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms | 1983-01-01 | Paper |
| Constructive assertions in an extension of classical mathematics | 1982-01-01 | Paper |
| The number of increasing subsequences of the random permutation | 1981-01-01 | Paper |
| The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis | 1980-01-01 | Paper |
| Semantical Completeness Theorems in Logic and Algebra | 1980-01-01 | Paper |
| CT 0 is Stronger than CT 0 ! | 1979-01-01 | Paper |
| An Intuitionistic Definition of Classical Natural Numbers | 1979-01-01 | Paper |
| Mathematical interpretation of the fan theorem | 1976-01-01 | Paper |
| Noncompact closed ball in a constructive compact metric space | 1976-01-01 | Paper |
| Investigation of constructive functions by the method of fillings | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4110985 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4113816 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5665179 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5638288 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5626620 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5628102 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5585414 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5570911 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5604463 | 1968-01-01 | Paper |
| Specialization of the form of deduction in the precicate calculus with equality and function symbols. I | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5536632 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5545503 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5581590 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5581620 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5596236 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5549805 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5646891 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5581621 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5549804 | 1967-01-01 | Paper |
| Consttuctive mathematical theories consistent with classical logic | 1967-01-01 | Paper |
