Projects funded by the NCN


Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

A new notion of finiteness in computation theory

2012/07/B/ST6/01497

Keywords:

Fraenkel-Mostowski set theory nominal sets

Descriptors:

  • ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms

Panel:

ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution :

Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki

woj. mazowieckie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr hab. Mikołaj Bojańczyk 

Number of co-investigators in the project: 8

Call: OPUS 4 - announced on 2012-09-15

Amount awarded: 565 800 PLN

Project start date (Y-m-d): 2013-08-29

Project end date (Y-m-d): 2016-08-28

Project duration:: 36 months (the same as in the proposal)

Project status: Project settled

Equipment purchased [PL]

  1. Komputery przenośne (12 000 PLN)

Information in the final report

  • Publication in academic press/journals (2)
  • Articles in post-conference publications (13)
  1. Equivariant algorithms for constraint satisfaction problems over coset templates
    Authors:
    S.Lasota
    Academic press:
    Information Processing Letters (rok: 2017, tom: 118, strony: 44-52), Wydawca: Elsevier
    Status:
    Accepted for publication
    DOI:
    10.1016/j.ipl.2016.09.009 - link to the publication
  2. Automata theory in nominal sets
    Authors:
    Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
    Academic press:
    Logical Methods in Computer Science (rok: 2014, tom: 10(3), strony: pismo elektroniczne), Wydawca: Institute of Theoretical Computer Science of the Technische Universität Braunschweig
    Status:
    Published
    DOI:
    10.2168/LMCS-10(3:4)2014 - link to the publication
  1. LOIS: an application of SMT solvers
    Authors:
    E. Kopczyński, S. Toruńczyk
    Conference:
    14th International Workshop on Satisfiability Modulo Theories (rok: 2016, ), Wydawca: CEUR-WS.org
    Data:
    konferencja 18 lipca 2016
    Status:
    Published
  2. Homomorphism problems for first-order definable structures
    Authors:
    B. Klin, S. Lasota, J. Ochremiak, Sz. Toruńczyk
    Conference:
    FSTTCS (rok: 2016, ), Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 13-15 Dec 2016
    Status:
    Accepted for publication
  3. SMT solving for functional programming over infinite structures
    Authors:
    B. Klin, M. Szynwelski
    Conference:
    6th Workshop on Mathematically Structured Functional Programming (MSFP 2016) (rok: 2016, ), Wydawca: Open Publishing Association
    Data:
    konferencja 8 kwietnia 2016
    Status:
    Published
  4. LOIS: syntax and semantics
    Authors:
    E. Kopczyński, S. Toruńczyk
    Conference:
    44th ACM SIGPLAN Symposium on Principles of Programming Languages (rok: 2017, ), Wydawca: ACM
    Data:
    konferencja styczeń 2017
    Status:
    Accepted for publication
  5. Coverability Trees for Petri Nets with Unordered Data
    Authors:
    Piotr Hofman, Sławomir Lasota, Ranko Lazic, Jerome Leroux, Sylvain Schmitz, Patrick Totzke
    Conference:
    Foundations of Software Science and Computation Structures (rok: 2016, ), Wydawca: Springer
    Data:
    konferencja 2-8 kwietnia
    Status:
    Published
  6. Locally Finite Constraint Satisfaction Problems
    Authors:
    Bartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk
    Conference:
    Logic in Computer Science (rok: 2015, ), Wydawca: IEEE
    Data:
    konferencja 6-10 lipca
    Status:
    Published
  7. Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
    Authors:
    Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk
    Conference:
    Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14 (rok: 2014, ), Wydawca: ACM
    Data:
    konferencja 14 - 18 lipca
    Status:
    Published
  8. Modal mu-calculus with atoms
    Authors:
    B. Klin, M. Łełyk
    Conference:
    32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (rok: 2017, ), Wydawca: ACM
    Data:
    konferencja 20-23 czerwca 2017
    Status:
    Submitted
  9. Algebraic Properties of Valued Constraint Satisfaction Problem
    Authors:
    Marcin Kozik, Joanna Ochremiak
    Conference:
    ICALP: Automata, Languages, and Programming - 42nd International Colloquium (rok: 2015, ), Wydawca: Springer
    Data:
    konferencja 6-10 czerwca
    Status:
    Published
  10. Decidability border for Petri nets with data: WQO dichotomy conjecture
    Authors:
    S.Lasota
    Conference:
    Application and Theory of Petri Nets and Concurrency - 37th International Conference, Petri Nets 2016 (rok: 2016, ), Wydawca: Springer
    Data:
    konferencja 19-24 Jun 2016
    Status:
    Published
  11. Reachability Analysis of First-order Definable Pushdown Systems
    Authors:
    Lorenzo Clemente, Sławomir Lasota
    Conference:
    Computer Science Logic (rok: 2015, ), Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Data:
    konferencja 7-10 września
    Status:
    Published
  12. Timed Pushdown Automata Revisited
    Authors:
    Lorenzo Clemente, Sławomir Lasota
    Conference:
    Logic in Computer Science (rok: 2015, ), Wydawca: IEEE
    Data:
    konferencja 6-10 lips
    Status:
    Published
  13. Nominal Sets over Algebraic Atoms
    Authors:
    Joanna Ochremiak
    Conference:
    Relational and Algebraic Methods in Computer Science - 14th International Conference, RAMiCS 2014 (rok: 2014, ), Wydawca: Springer
    Data:
    konferencja 28 kwietnia - 1 maja
    Status:
    Published