Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

dr hab. Emanuel Kieroński

Pracownik  

2015

  1. E. Kieroński, A. Kuusisto, Uniform one-dimensional fragments with one equivalence relation, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) / Stephan Kreutzer (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 41).- S. 597-615. (http://dx.doi.org/10.4230/LIPIcs.CSL.2015.597)
  2. E. Kieroński, J. Michaliszyn, J. Otop, On the decidability of elementary modal logics, ACM Transactions on Computational Logic. - Vol. 17, iss. 1 (2015), nr art. 2 (47 str.). (http://dx.doi.org/10.1145/2811262)

2014

  1. E. Kieroński, A. Kuusisto, Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality, MFCS 2014. Budapest, Hungary, August 26-29, 2014. Proceedings, Part I, LNCS 8634, pp. 365--376. (http://link.springer.com/chapter/10.1007%2F978-3-662-44522-8_31)
  2. W. Charatonik, E. Kieroński, F. Mazowiecki, Decidability of Weak Logics with Deterministic Transitive Closure, CSL-LICS 2014. Vienna, Austria, July 14 - 18, 2014. Proceedings, pp. 29:1--29:10. (http://dl.acm.org/citation.cfm?doid=2603088.2603134)
  3. E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, L. Tendera, Two-variable First-order Logic with Equivalence Closure, SIAM Journal on Computing, Volume 43, Issue 3, 2014, pp. 1012--1063. (http://epubs.siam.org/doi/abs/10.1137/120900095)

2013

  1. W. Charatonik, E. Kieroński, S. Benaim, M. Benedikt, R. Lenhardt, F. Mazowiecki, J. Worrell, Complexity of two-variable logic on finite trees, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7966). - S. 74-88. (http://dx.doi.org/10.1007/978-3-642-39212-2_10)

2012

  1. E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, L. Tendera, Two-variable first-order logic with equivalence closure, Proceedings of the 27th Annual ACM/IEEE Symposium on Logic in Computer Science ; 25-28 June 2012, Dubrovnik, Croatia. - Los Alamitos : IEEE Computer Society, 2012.- S. 431-440. (http://dx.doi.org/10.1109/LICS.2012.53)
  2. E. Kieroński, J. Michaliszyn, Two-variable universal logic with transitive closure, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France / Patrick Cégielski, Arnaud Durand (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.16).- S. 396-410. (http://dx.doi.org/10.4230/LIPIcs.CSL.2012.396)
  3. E. Kieroński, M. Otto, Small substructures and decidability issues for first-order logic with two variables, Journal of Symbolic Logic. - Vol. 77, iss. 3 (2012), s. 729-765. (http://projecteuclid.org/DPubS?service=UI)
  4. E. Kieroński, J. Michaliszyn, Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames, AIML 2012. 27th Annual Symposium on Advances in Modal Logic. Copenhagen, Denmark, August 25-28, 2012. Proceedings, pages 464-482, RK.

2011

  1. E. Kieroński, Decidability issues for two-variable logics with several linear orders, w: Computer Science Logic (CSL'11), 25th International Workshop/20th Annual Conference of the EACSL / Marc Bezem ed., Wadern, Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2011 (Leibniz International Proceedings in Informatics (LIPIcs), 12), 337-351, CSL 2011, September 12-15, 2011, Bergen, Norway. (http://dx.doi.org/10.4230/LIPIcs.CSL.2011.337)
  2. E. Kieroński, J. Michaliszyn, J. Otop, Modal logics definable by universal three-variable formulas, w: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) /Supratik Chakraborty, Amit Kumar (eds.), Wadern: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2011 (Leibniz International Proceedings in Informatics (LIPIcs), 13), 264-275, FSTTCS 2011, December 12-14, 2011, Mumbai, India. (http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.264)

2010

  1. E. Kieroński, J. Marcinkowski, J. Michaliszyn, B and D Are Enough to Make the Halpern-Shoham Logic Undecidable, Lecture Notes in Computer Science, Volume 6199, ICALP (2) 2010: 357-368, 2010.

2009

  1. E. Kieroński, L. Tendera, On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations, Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science Computer Science, LICS 2009: 123-132, IEEE Computer Society. (http://www.ii.uni.wroc.pl/~kiero/lics09.ps)

2007

  1. E. Kieroński, L. Tendera, On Finite Satisfiability ofthe Guarded Fragment with Equivalence or Transitive Guards (red. A. Lipitakis), Proceedings, LPAR 2007, Lecture Notes in Artificial Intelligence 4790, 318-332. Full paper: Electronic print, ERCMA 2007 Conference Proceedings.

2006

  1. E. Kieroński, On the Complexity of the Two-Variable Guarded Fragment with Transitive Guards, Information and Computation 204, 2006, 1663-1703.

2005

  1. E. Kieroński, M. Otto, Small Substructures and Decidability Issues for First-Order Logic with Two Variables, 20th Annual IEEE Symposium on Logic in Computer Science, Proceedings, 2005, 448-457.
  2. E. Kieroński, Results on the Guarded Fragment with Equivalence or Transitive Relations, Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, LNCS 3634, 2005, 309-324.

2003

  1. E. Kieroński, The Two-Variable Guarded Fragment with Transitive Guards is 2EXPTIME-Hard, Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, Proceedings, LNCS 2620, pages 299-312, 2003.

2002

  1. E. Kieroński, EXPSPACE-Complete Variant of Guarded Fragment with Transitivity, 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, Antibes – Juan les Pins, France, March 14-16, 2002, Proceedings. LNCS 2285 Springer 2002, 608-619.

Adres:
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
Sekretariat
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
sekretariat@ii.uni.wroc.pl
Dziekanat
tel.: 71 375 7892
dziekan@ii.uni.wroc.pl
sprawy studenckie:
dziekanat@ii.uni.wroc.pl
Portiernia
tel.: 71 375 7958
Redaktor strony WWW
redaktor@ii.uni.wroc.pl
Projekt
MAKOS