×

Found 69 Documents (Results 1–69)

Quantaloidal approach to constraint satisfaction. (English) Zbl 07804588

Kishida, Kohei (ed.), Proceedings of the fourth international conference on applied category theory 2021, ACT 2021, Cambridge, UK, July 12–16, 2021. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 372, 289-305 (2022).
MSC:  18N10 08A70
PDFBibTeX XMLCite
Full Text: arXiv Link

Approximate counting CSP seen from the other side. (English) Zbl 1499.68238

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 60, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Dismantlability, connectedness, and mixing in relational structures. (English) Zbl 1503.08001

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 29, 15 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Consistency for counting quantifiers. (English) Zbl 1510.68031

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 11, 13 p. (2018).
MSC:  68Q25 03B70 08A70
PDFBibTeX XMLCite
Full Text: DOI

Hybrid VCSPs with crisp and valued conservative templates. (English) Zbl 1457.68130

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 65, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

The quantum monad on relational structures. (English) Zbl 1441.68055

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 35, 19 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algebraic properties of valued constraint satisfaction problem. (English) Zbl 1441.68098

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 846-858 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A Galois connection for valued constraint languages of infinite size. (English) Zbl 1440.68115

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 517-528 (2015).
PDFBibTeX XMLCite
Full Text: DOI

On Maltsev digraphs. (English) Zbl 1332.68068

Kulikov, Alexander (ed.) et al., Computer science – theory and applications. 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20711-2/pbk). Lecture Notes in Computer Science 6651, 181-194 (2011).
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software