Improving Refutational Completeness of Relational Search via Divergence Test. - Dmitri Rozplokhas; Dmitri Boulytchev (PPDP, 2018)

Certified Semantics for Relational Programming. - Dmitry Rozplokhas; Andrey Vyatkin; Dmitry Boulytchev (APLAS, 2020)

The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them. - Ekaterina Komendantskaya; Dmitry Rozplokhas; Henning Basold (Theory Pract. Log. Program., 2020)

Scheduling Complexity of Interleaving Search. - Dmitry Rozplokhas; Dmitry Boulytchev (FLOPS, 2022)

Analytic Proof Theory for Åqvist's System F. - Agata Ciabattoni; Nicola Olivetti; Xavier Parent 001; Revantha Ramanayake; Dmitry Rozplokhas (DEON, 2023)

Streamlining Input/Output Logics with Sequent Calculi. - Agata Ciabattoni; Dmitry Rozplokhas (KR, 2023)

LEGO-Like Small Model Constructions for Åqvist's Logics. - Dmitry Rozplokhas (AiML, 2024)

Streamlining Input/Output Logics with Sequent Calculi (Extended Abstract). - Agata Ciabattoni; Dmitry Rozplokhas (IJCAI, 2024)

Strongly Analytic Calculi for KLM Logics with SMT-Based Prover. - Agata Ciabattoni; Clemens Eisenhofer; Dmitry Rozplokhas (KR, 2024)

A Non-Interventionist Approach to Causal Reasoning based on Lewisian Counterfactuals. - Carlos Aguilera-Ventura; Xinghan Liu; Emiliano Lorini; Dmitry Rozplokhas (CoRR, 2025)