Piotr Witkowski

15 papers A* 2B 3C 1Journal 6Unranked 3
YearRankTypeTitle / Venue / Authors
2021 J jnl
Completing the Picture: Complexity of Graded Modal Logics with Converse.
Theory Pract. Log. Program.
Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
2020 C conf
A Note on C² Interpreted over Finite Data-Words.
TIME
Bartosz Bednarczyk, Piotr Witkowski
2019 A* conf
Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications.
IJCAI
Jakub Michaliszyn, Piotr Witkowski
2019 B conf
On the Complexity of Graded Modal Logics with Converse.
JELIA
Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
2018 J jnl
On the Complexity of Graded Modal Logics with Converse.
CoRR
Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
2018 J jnl
Satisfiability versus Finite Satisfiability in Elementary Modal Logics.
Fundam. Informaticae
Jakub Michaliszyn, Jan Otop, Piotr Witkowski
2018 B conf
Two-variable First-Order Logic with Counting in Forests.
LPAR
Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski
2016 J jnl
Bounded Model Checking of Pointer Programs Revisited.
CoRR
Witold Charatonik, Piotr Witkowski
2016 J jnl
Two-Variable Logic with Counting and Trees.
ACM Trans. Comput. Log.
Witold Charatonik, Piotr Witkowski
2016 J jnl
Two-variable Logic with Counting and a Linear Order.
Log. Methods Comput. Sci.
Witold Charatonik, Piotr Witkowski
2015 B conf
Two-variable Logic with Counting and a Linear Order.
CSL
Witold Charatonik, Piotr Witkowski
2013 A* conf
Two-Variable Logic with Counting and Trees.
LICS
Witold Charatonik, Piotr Witkowski
2012 — conf
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics
GandALF
Jakub Michaliszyn, Jan Otop, Piotr Witkowski
2010 — conf
On the Complexity of the Bernays-Schönfinkel Class with Datalog.
LPAR (Yogyakarta)
Witold Charatonik, Piotr Witkowski
2008 — conf
A Small Framework for Proof Checking.
PAAR/ESHOL
Hans de Nivelle, Piotr Witkowski