ACM/IEEE Logic in Computer Science, LICS 2017


Article Details
Title: The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems
Article URLs:
Alternative Article URLs:
Authors: Libor Barto
  • Charles University in Prague, Department of Algebra
  • Charles University in Prague, Faculty of Mathematics and Physics
Michael Kompatscher
  • Technische Universität Wien, Institut für Computersprachen
  • Technische Universität Wien, Theory and Logic Group
Miroslav Olsák
  • Charles University, Department of Algebra
  • Charles University in Prague, Faculty of Mathematics and Physics
Trung Van Pham
  • Technische Universität Wien, Institut für Computersprachen
  • Technische Universität Wien, Theory and Logic Group
Michael Pinsker
  • Charles University in Prague, Department of Algebra
  • Charles University in Prague, Faculty of Mathematics and Physics
Sharing: Other
Verification: Authors have verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/lics/BartoKOPP17
Author Comments:

Discuss this paper and its artifacts below