A Small Framework for Proof Checking. - Hans de Nivelle; Piotr Witkowski 001 (PAAR/ESHOL, 2008)

On the Complexity of the Bernays-Schönfinkel Class with Datalog. - Witold Charatonik; Piotr Witkowski 001 (LPAR (Yogyakarta), 2010)

Satisfiability vs. Finite Satisfiability in Elementary Modal Logics - Jakub Michaliszyn; Jan Otop; Piotr Witkowski 001 (GandALF, 2012)

Bounded Model Checking of Pointer Programs Revisited. - Witold Charatonik; Piotr Witkowski 001 (CoRR, 2016)

Two-variable Logic with Counting and a Linear Order. - Witold Charatonik; Piotr Witkowski 001 (Log. Methods Comput. Sci., 2016)

Two-Variable Logic with Counting and Trees. - Witold Charatonik; Piotr Witkowski 001 (ACM Trans. Comput. Log., 2016)

Two-variable First-Order Logic with Counting in Forests. - Witold Charatonik; Yegor Guskov; Ian Pratt-Hartmann; Piotr Witkowski 001 (LPAR, 2018)

Satisfiability versus Finite Satisfiability in Elementary Modal Logics. - Jakub Michaliszyn; Jan Otop; Piotr Witkowski 001 (Fundam. Informaticae, 2018)

Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications. - Jakub Michaliszyn; Piotr Witkowski 001 (IJCAI, 2019)

On the Complexity of Graded Modal Logics with Converse. - Bartosz Bednarczyk; Emanuel Kieronski; Piotr Witkowski 001 (JELIA, 2019)

A Note on C² Interpreted over Finite Data-Words. - Bartosz Bednarczyk; Piotr Witkowski 001 (TIME, 2020)

Completing the Picture: Complexity of Graded Modal Logics with Converse. - Bartosz Bednarczyk; Emanuel Kieronski; Piotr Witkowski 001 (Theory Pract. Log. Program., 2021)