| Publication | Date of Publication | Type |
|---|
| Generalizing the syntax of terms in mini-\textsc{gringo} | 2025-12-15 | Paper |
| An experiment with anthem: semantic equivalence of tiling programs | 2025-12-15 | Paper |
| From felicitous models to answer set programming | 2025-10-24 | Paper |
| Calculational proofs | 2024-10-28 | Paper |
| On Heuer's procedure for verifying strong equivalence | 2024-05-29 | Paper |
Here and There with Arithmetic
Theory and Practice of Logic Programming | 2023-12-12 | Paper |
Towards Verifying Logic Programs in the Input Language of clingo
Fields of Logic and Computation III | 2022-11-09 | Paper |
Strong Equivalence of Logic Programs with Counting
Theory and Practice of Logic Programming | 2022-09-30 | Paper |
Loop checking and the well-founded semantics
Logic Programming and Nonmonotonic Reasoning | 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
Theory and Practice of Logic Programming | 2020-12-13 | Paper |
Relating two dialects of answer set programming
Theory and Practice of Logic 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
Journal of Applied Non-Classical Logics | 2018-08-28 | Paper |
Abstract gringo
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
On equivalence of infinitary formulas under the stable model semantics
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
Stable models for infinitary formulas with extensional atoms
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
Proving infinitary formulas
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
Achievements in answer set programming
Theory and Practice of Logic Programming | 2017-11-08 | Paper |
Program completion in the input language of GRINGO
Theory and Practice of Logic Programming | 2017-11-08 | Paper |
Why are there so many loop formulas?
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| Eliminating function symbols from a nonmonotoic causal theory | 2016-07-26 | Paper |
In memoriam: Grigori E. Mints (1939--2014)
The Bulletin of Symbolic Logic | 2016-03-21 | Paper |
The dramatic true story of the frame default
Journal of Philosophical Logic | 2015-04-23 | Paper |
Lloyd-Topor completion and general stable models
Theory and Practice of Logic Programming | 2014-02-27 | Paper |
| Two-valued logic programs | 2014-02-25 | Paper |
Obituary: Nikolai Aleksandrovich Shanin (1919--2011)
Russian Mathematical Surveys | 2013-12-17 | Paper |
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
Logic Programming and Nonmonotonic Reasoning | 2013-10-10 | Paper |
Relational theories with null values and non-Herbrand stable models
Theory and Practice of Logic Programming | 2013-03-13 | Paper |
Representing first-order causal theories by logic programs
Theory and Practice of Logic Programming | 2012-08-30 | Paper |
| Yet another characterization of strong equivalence | 2012-08-29 | Paper |
| scientific article; zbMATH DE number 5910656 (Why is no real title available?) | 2011-06-21 | Paper |
Stable models and circumscription
Artificial Intelligence | 2011-06-17 | Paper |
Termination of grounding is not preserved by strongly equivalent transformations
Logic Programming and Nonmonotonic Reasoning | 2011-05-26 | Paper |
On the minimality of stable models
Lecture Notes in Computer Science | 2011-05-19 | Paper |
| From C-believed propositions to the causal calculator | 2011-05-06 | Paper |
Translating first-order causal theories into answer set programming
Logics in Artificial Intelligence | 2010-10-01 | Paper |
Thirteen Definitions of a Stable Model
Fields of Logic and Computation | 2010-09-03 | Paper |
Logic Programming
Lecture Notes in Computer Science | 2009-08-06 | Paper |
One More Decidable Class of Finitely Ground Programs
Logic Programming | 2009-07-24 | Paper |
Safe Formulas in the General Theory of Stable Models (Preliminary Report)
Logic Programming | 2009-01-22 | Paper |
Twelve Definitions of a Stable Model
Logic Programming | 2009-01-22 | Paper |
| scientific article; zbMATH DE number 5212421 (Why is no real title available?) | 2007-11-16 | Paper |
Logic Programming and Nonmonotonic Reasoning
Lecture Notes in Computer Science | 2007-11-07 | Paper |
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence | 2006-12-20 | Paper |
Temporal phylogenetic networks and logic programming
Theory and Practice of Logic Programming | 2006-08-28 | Paper |
Nonmonotonic causal theories
Artificial Intelligence | 2006-02-07 | Paper |
Representing the Zoo World and the Traffic World in the language of the Causal Calculator
Artificial Intelligence | 2006-02-07 | Paper |
Weight constraints as nested expressions
Theory and Practice of Logic Programming | 2005-04-29 | Paper |
Tight logic programs
Theory and Practice of Logic Programming | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2085281 (Why is no real title available?) | 2004-08-09 | Paper |
Nikolai Aleksandrovich Shanin (on his 80th birthday)
Russian Mathematical Surveys | 2003-08-28 | Paper |
| scientific article; zbMATH DE number 1954109 (Why is no real title available?) | 2003-07-28 | Paper |
Nested abnormality theories
Artificial Intelligence | 2003-02-04 | Paper |
Answer set programming and plan generation
Artificial Intelligence | 2002-07-15 | Paper |
On calculational proofs
Annals of Pure and Applied Logic | 2002-03-13 | Paper |
| scientific article; zbMATH DE number 1368932 (Why is no real title available?) | 2002-02-21 | Paper |
| scientific article; zbMATH DE number 1696838 (Why is no real title available?) | 2002-01-28 | Paper |
| Getting to the airport: The oldest planning problem in AI | 2001-08-30 | Paper |
| scientific article; zbMATH DE number 1531964 (Why is no real title available?) | 2000-11-19 | Paper |
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1453058 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1453059 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1390359 (Why is no real title available?) | 2000-03-22 | Paper |
On the logic of causal explanation
Artificial Intelligence | 1998-08-13 | Paper |
Representing action: indeterminacy and ramifications
Artificial Intelligence | 1998-06-30 | Paper |
Two components of an action language
Annals of Mathematics and Artificial Intelligence | 1998-06-09 | Paper |
ECWA made easy
Annals of Mathematics and Artificial Intelligence | 1997-01-14 | Paper |
Minimal belief and negation as failure
Artificial Intelligence | 1995-09-11 | Paper |
Representing action and change by logic programs
The Journal of Logic Programming | 1994-03-20 | Paper |
| scientific article; zbMATH DE number 140388 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 140402 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 67490 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 25190 (Why is no real title available?) | 1992-06-26 | Paper |
Frames in the space of situations
Artificial Intelligence | 1992-06-25 | Paper |
Circumscriptive theories: A logic-based framework for knowledge representation
Journal of Philosophical Logic | 1992-06-25 | Paper |
What is the inverse method?
Journal of Automated Reasoning | 1989-01-01 | Paper |
Miracles in formal theories of action
Artificial Intelligence | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4158607 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4106291 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4174351 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4106301 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4185010 (Why is no real title available?) | 1988-01-01 | Paper |
On the satisfiability of circumscription
Artificial Intelligence | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3985190 (Why is no real title available?) | 1986-01-01 | Paper |
Closed-world databases and circumscription
Artificial Intelligence | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3979055 (Why is no real title available?) | 1985-01-01 | Paper |
On verification of programs with goto statements
Information Processing Letters | 1984-01-01 | Paper |
A note on the complexity of a partition algorithm
Information Processing Letters | 1983-01-01 | Paper |
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms
SIAM Journal on Computing | 1983-01-01 | Paper |
Constructive assertions in an extension of classical mathematics
Journal of Symbolic Logic | 1982-01-01 | Paper |
The number of increasing subsequences of the random permutation
Journal of Combinatorial Theory. Series A | 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 !
Proceedings of the American Mathematical Society | 1979-01-01 | Paper |
| An Intuitionistic Definition of Classical Natural Numbers | 1979-01-01 | Paper |
Mathematical interpretation of the fan theorem
Journal of Soviet Mathematics | 1976-01-01 | Paper |
Noncompact closed ball in a constructive compact metric space
Journal of Soviet Mathematics | 1976-01-01 | Paper |
Investigation of constructive functions by the method of fillings
Journal of Soviet Mathematics | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3534472 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3537657 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3397525 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3351525 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3365223 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3353252 (Why is no real title available?) | 1969-01-01 | Paper |
Specialization of the form of deduction in the precicate calculus with equality and function symbols. I
Proceedings of the Steklov Institute of Mathematics | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3304059 (Why is no real title available?) | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3287711 (Why is no real title available?) | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3325569 (Why is no real title available?) | 1968-01-01 | Paper |
Consttuctive mathematical theories consistent with classical logic
Proceedings of the Steklov Institute of Mathematics | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3264071 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3375482 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3299735 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3264070 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3249778 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3257388 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3299684 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3299734 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3315202 (Why is no real title available?) | 1967-01-01 | Paper |
