Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Anuj Dawar, Erich Grädel, and Wied Pakusa. Approximations of Isomorphism and Logics with Linear-Algebraic Operators (Track B: Automata, Logic, Semantics, and Theory of Programming). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 112:1-112:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dawar_et_al:LIPIcs.ICALP.2019.112, author = {Dawar, Anuj and Gr\"{a}del, Erich and Pakusa, Wied}, title = {{Approximations of Isomorphism and Logics with Linear-Algebraic Operators}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {112:1--112:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.112}, URN = {urn:nbn:de:0030-drops-106887}, doi = {10.4230/LIPIcs.ICALP.2019.112}, annote = {Keywords: Finite Model Theory, Graph Isomorphism, Descriptive Complexity, Algebra} }
Published in: LIPIcs, Volume 82, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017)
Erich Grädel, Benedikt Pago, and Wied Pakusa. The Model-Theoretic Expressiveness of Propositional Proof Systems. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 82, pp. 27:1-27:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gradel_et_al:LIPIcs.CSL.2017.27, author = {Gr\"{a}del, Erich and Pago, Benedikt and Pakusa, Wied}, title = {{The Model-Theoretic Expressiveness of Propositional Proof Systems}}, booktitle = {26th EACSL Annual Conference on Computer Science Logic (CSL 2017)}, pages = {27:1--27:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-045-3}, ISSN = {1868-8969}, year = {2017}, volume = {82}, editor = {Goranko, Valentin and Dam, Mads}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.27}, URN = {urn:nbn:de:0030-drops-76897}, doi = {10.4230/LIPIcs.CSL.2017.27}, annote = {Keywords: Propositional proof systems, fixed-point logics, resolution, polynomial calculus, generalized quantifiers} }
Published in: LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Wied Pakusa, Svenja Schalthöfer, and Erkal Selman. Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 62, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{pakusa_et_al:LIPIcs.CSL.2016.19, author = {Pakusa, Wied and Schalth\"{o}fer, Svenja and Selman, Erkal}, title = {{Definability of Cai-F\"{u}rer-Immerman Problems in Choiceless Polynomial Time}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {19:1--19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.19}, URN = {urn:nbn:de:0030-drops-65595}, doi = {10.4230/LIPIcs.CSL.2016.19}, annote = {Keywords: finite model theory, descriptive complexity, logic for textsc\{Ptime\}, Choiceless Polynomial Time, Cai-F\"{u}rer-Immerman} }
Published in: LIPIcs, Volume 41, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Erich Grädel and Wied Pakusa. Rank Logic is Dead, Long Live Rank Logic!. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 390-404, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{gradel_et_al:LIPIcs.CSL.2015.390, author = {Gr\"{a}del, Erich and Pakusa, Wied}, title = {{Rank Logic is Dead, Long Live Rank Logic!}}, booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)}, pages = {390--404}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-90-3}, ISSN = {1868-8969}, year = {2015}, volume = {41}, editor = {Kreutzer, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.390}, URN = {urn:nbn:de:0030-drops-54279}, doi = {10.4230/LIPIcs.CSL.2015.390}, annote = {Keywords: logic, descriptive complexity, polynomial time, rank logic} }
Published in: LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012)
Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, and Wied Pakusa. Definability of linear equation systems over groups and rings. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 213-227, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{dawar_et_al:LIPIcs.CSL.2012.213, author = {Dawar, Anuj and Gr\"{a}del, Erich and Holm, Bjarki and Kopczynski, Eryk and Pakusa, Wied}, title = {{Definability of linear equation systems over groups and rings}}, booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL}, pages = {213--227}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-42-2}, ISSN = {1868-8969}, year = {2012}, volume = {16}, editor = {C\'{e}gielski, Patrick and Durand, Arnaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.213}, URN = {urn:nbn:de:0030-drops-36749}, doi = {10.4230/LIPIcs.CSL.2012.213}, annote = {Keywords: inite model theory, logics with algebraic operators} }
Feedback for Dagstuhl Publishing