Piotr Witkowski

Orcid: 0000-0002-1908-0827

Affiliations:
  • University of Wroclaw, Institute of Computer Science, Poland


According to our database1, Piotr Witkowski authored at least 12 papers between 2008 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Completing the Picture: Complexity of Graded Modal Logics with Converse.
Theory Pract. Log. Program., 2021

2020
A Note on C² Interpreted over Finite Data-Words.
Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, 2020

2019
On the Complexity of Graded Modal Logics with Converse.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Satisfiability versus Finite Satisfiability in Elementary Modal Logics.
Fundam. Informaticae, 2018

Two-variable First-Order Logic with Counting in Forests.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

2016
Two-Variable Logic with Counting and Trees.
ACM Trans. Comput. Log., 2016

Two-variable Logic with Counting and a Linear Order.
Log. Methods Comput. Sci., 2016

Bounded Model Checking of Pointer Programs Revisited.
CoRR, 2016

2012
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics
Proceedings of the Proceedings Third International Symposium on Games, 2012

2010
On the Complexity of the Bernays-Schönfinkel Class with Datalog.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2008
A Small Framework for Proof Checking.
Proceedings of the First International Workshop on Practical Aspects of Automated Reasoning, 2008


  Loading...