Daniel Danielski

Orcid: 0000-0001-7367-4936

According to our database1, Daniel Danielski authored at least 3 papers between 2018 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Finite Satisfiability of Unary Negation Fragment with Transitivity.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Finite Satisfiability of Unary Negation Fragment with Transitivity (Extended Abstract).
Proceedings of the 32nd International Workshop on Description Logics, 2019

2018
Unary negation fragment with equivalence relations has the finite model property.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018


  Loading...