Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

DATALOG in Constraint Satisfaction Problem

2011/01/B/ST6/01006

Keywords:

computational complexity descriptive complexity Constraint Satisfaction Problem

Descriptors:

  • ST6_7: Artificial intelligence, intelligent systems, multi-agent systems
  • ST1_15: Mathematical aspects of computer science
  • ST6_2: Computer systems, parallel/distributed systems, sensor networks, embedded systems, cyber-physical systems

Panel:

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

Host institution :

Uniwersytet Jagielloński, Wydział Matematyki i Informatyki

woj. małopolskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr hab. Marcin Kozik 

Number of co-investigators in the project: 2

Call: OPUS 1 - announced on 2011-03-15

Amount awarded: 289 900 PLN

Project start date (Y-m-d): 2011-12-07

Project end date (Y-m-d): 2015-06-06

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

Project status: Project settled

Information in the final report

  • Publication in academic press/journals (5)
  • Articles in post-conference publications (3)
  • Book publications / chapters in book publications (1)
  1. Mal'tsev conditions, lack of absorption and solvability
    Authors:
    Libor Barto, Marcin Kozik, David Stanovsky
    Academic press:
    Algebra Universalis (rok: 2015, tom: brak, strony: brak), Wydawca: SPRINGER BASEL AG
    Status:
    Published
    DOI:
    10.1007/s00012-015-0327-2 - link to the publication
  2. Robustly Solvable Constraint Satisfaction Problems
    Authors:
    Libor Barto, Marcin Kozik
    Academic press:
    SIAM Journal on Computing (rok: 2012, ), Wydawca: SIAM PUBLICATIONS
    Status:
    Accepted for publication
    DOI:
    brak - link to the publication
  3. Characterizations of several Mal'tsev conditions
    Authors:
    Marcin Kozik, Andrey Krokhin, Matthew Valeriote i Ross Willard
    Academic press:
    Algebra Universalis (rok: 2015, tom: 73, strony: 205-224), Wydawca: SPRINGER BASEL AG
    Status:
    Published
    DOI:
    10.1007/s00012-015-0338-z - link to the publication
  4. Constraint satisfaction problems solvable by local consistency methods
    Authors:
    Libor Barto, Marcin Kozik
    Academic press:
    Journal of the ACM (rok: 2014, tom: 61/1, strony: article no. 3), Wydawca: ASSOC COMPUTING MACHINERY
    Status:
    Published
    DOI:
    10.1145/2556646 - link to the publication
  5. Deciding absorption in relational structures
    Authors:
    Libor Barto i Jakub Bulin
    Academic press:
    Algebra Universalis , Wydawca: Springer
    Status:
    Submitted
    DOI:
    brak - link to the publication
  1. Algebraic properties of Valued Cosntraint Satisfaction Problem
    Authors:
    Marcin Kozik, Joanna Ochremiak
    Conference:
    The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) (rok: 2015, ), Wydawca: Springer-Verlag
    Data:
    konferencja 6-10.06.2015
    Status:
    Published
  2. Near Unanimity Constraints Have Bounded Pathwidth Duality
    Authors:
    Libor Barto, Marcin Kozik, Ross Willard
    Conference:
    Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on (rok: 2012, ), Wydawca: IEEE
    Data:
    konferencja 25-28 czerwiec
    Status:
    Published
    DOI:
    link to the publication
  3. Weak consistency notions for all CSPs of bounded width
    Authors:
    Marcin Kozik
    Conference:
    The 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (rok: 2016, ), Wydawca: IEEE
    Data:
    konferencja 5-8.07.2016
    Status:
    Accepted for publication
  1. Absorption and directed Jónsson terms
    Authors:
    Alexandr Kazda, Marcin Kozik, Ralph Mckenzie, Matthew Moore
    Book:
    Outstanding Constributions in Logic , Wydawca: Springer Verlag
    Status:
    Submitted

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy