Výsledky vyhľadávania - "Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science"

Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures.

Autori: Mottet, Antoine Pinsker, Michael

Zdroj: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-47, 47p

Predmety: RANDOM graphs, CONSTRAINT satisfaction, LOGICAL prediction, TOURNAMENTS, MACHINERY

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Autori: Bojanczyk, Mikolaj Klin, Bartek Moerman, Joshua

Zdroj: New York, NY, United States : Association for Computing Machinery, ACM Conferences [1]-13 (2021). doi:10.1109/LICS52264.2021.9470634 ; Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science ; Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science 36. Annual ACM/IEEE Symposium on Logic in Computer Science, LICS, Rome, Italy, 2021-06-29 - 2021-07-02

Geografické téma: DE

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000947350400053; info:eu-repo/semantics/altIdentifier/isbn/978-1-6654-4896-3; info:eu-repo/semantics/altIdentifier/isbn/978-1-6654-4895-6; info:eu-repo/semantics/altIdentifier/issn/1043-6871; info:eu-repo/grantAgreement/EC//787914

Dostupnosť: https://publications.rwth-aachen.de/record/847230
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2022-05166%22

The Logic of Graph Neural Networks

Autori: Grohe, Martin

Zdroj: New York,NY,United States : Association for Computing Machinery, ACM Conferences 17 Seiten (2021). doi:10.1109/LICS52264.2021.9470677 ; Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science / Gorla, Daniele ; Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science / Gorla, Daniele 36. Annual ACM/IEEE Symposium on Logic in Computer Science, LICS, Rome, Italy, 2021-06-29 - 2021-07-02

Geografické téma: DE

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-1-6654-4896-3; info:eu-repo/semantics/altIdentifier/isbn/978-1-6654-4895-6; info:eu-repo/semantics/altIdentifier/issn/1043-6871; info:eu-repo/semantics/altIdentifier/wos/WOS:000947350400067

Dostupnosť: https://publications.rwth-aachen.de/record/822868
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2021-07045%22

Lovász-Type Theorems and Game Comonads

Autori: DAWAR A JAKL T REGGIO L a ďalší

Prispievatelia: DAWAR A JAKL T REGGIO L a ďalší

Zdroj: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Game comonads, Homomorphism counting, k-Weisfeiler-Leman equivalence, 4901 Applied Mathematics, 5003 Philosophy, 4904 Pure Mathematics, Mathematics - Category Theory, Mathematics - Logic, 0102 computer and information sciences, 01 natural sciences, Logic in Computer Science (cs.LO), 50 Philosophy and Religious Studies, 49 Mathematical Sciences, FOS: Mathematics, Category Theory (math.CT), 0101 mathematics, Logic (math.LO)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/2105.03274
http://arxiv.org/abs/2105.03274
https://ora.ox.ac.uk/objects/uuid:700b2cbd-e32e-4090-a17c-618fe4880eb7
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-03274
http://easyconferences.eu/lics2021/accepted-papers/#12
https://doi.org/10.1109/LICS52264.2021.9470609
https://www.repository.cam.ac.uk/handle/1810/326013
https://doi.org/10.17863/cam.73470
https://doi.org/10.1109/lics52264.2021.9470609

Choiceless Polynomial Time with Witnessed Symmetric Choice.

Autori: Lichter, Moritz Schweitzer, Pascal

Zdroj: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-70, 70p

Predmety: POLYNOMIAL time algorithms, SYMMETRIC operators, AUTOMORPHISMS, ORBITS (Astronomy), CANONIZATION

The Topological Mu-Calculus: Completeness and Decidability.

Autori: BALTAG, ALEXANDRU BEZHANISHVILI, NICK FERNÁNDEZ-DUQUE, DAVID

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-38, 38p

Predmety: MODAL logic, TOPOLOGICAL spaces, CANTOR sets

A Domain-theoretic Approach to Statistical Programming Languages.

Autori: GOUBAULT-LARRECQ, JEAN XIAODONG JIA THÉRON, CLÉMENT

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-63, 63p

Predmety: PROGRAMMING languages, PROGRAMMING language semantics, PROGRAM transformation, REAL numbers

Quantitative and approximate monitoring

Autori: Henzinger, Thomas A Sarac, Naci E

Zdroj: Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science . Institute of Electrical and Electronics Engineers; 2021. doi: 10.1109/LICS52264.2021.9470547

Predmety: ddc:000

Relation: info:eu-repo/semantics/altIdentifier/wos/000947350400021; info:eu-repo/semantics/altIdentifier/arxiv/2105.08353

Dostupnosť: https://research-explorer.ista.ac.at/record/9356
https://research-explorer.ista.ac.at/download/9356/9557

Stochastic processes with expected stopping time

Autori: Chatterjee, Krishnendu Doyen, Laurent

Zdroj: Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science . Institute of Electrical and Electronics Engineers; 2021:1-13. doi: 10.1109/LICS52264.2021.9470595

Predmety: Computer science, Heuristic algorithms, Memory management, Automata, Markov processes, Probability distribution, Complexity theory

Relation: info:eu-repo/semantics/altIdentifier/issn/1043-6871; info:eu-repo/semantics/altIdentifier/isbn/978-1-6654-4896-3; info:eu-repo/semantics/altIdentifier/e-isbn/978-1-6654-4895-6; info:eu-repo/semantics/altIdentifier/wos/000947350400036; info:eu-repo/semantics/altIdentifier/arxiv/2104.07278

Dostupnosť: https://research-explorer.ista.ac.at/record/10004

Expressivity of Quantitative Modal Logics: Categorical Foundations via Codensity and Approximation

Autori: Komorida, Yuichi Katsumata, Shin-ya Kupke, Clemens a ďalší

Témy: Computer Science - Logic in Computer Science, text

URL: http://arxiv.org/abs/2105.10164

Monomial-size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus

Autori: Hakoniemi, Tuomas

Témy: Computer Science - Computational Complexity, Computer Science - Logic in Computer Science, text

URL: http://arxiv.org/abs/2105.07525

Lov\'asz-Type Theorems and Game Comonads

Autori: Dawar, Anuj Jakl, Tomáš Reggio, Luca

Témy: Computer Science - Logic in Computer Science, Mathematics - Category Theory, Mathematics - Logic, text

URL: http://arxiv.org/abs/2105.03274

Research on group type theory and its functorial semantic models in category logic.

Autori: Tang, Jian-Gang Aishan, Yimamujiang Liu, Ji-Yu a ďalší

Zdroj: PLoS ONE; 6/24/2025, Vol. 20 Issue 6, p1-17, 17p

Predmety: CONCRETE construction, ALGEBRAIC equations, GROUP theory, LIMITS (Mathematics), DATA structures

General monitorability of totally ordered verdict domains.

Autori: Gorostiaga, Felipe Sánchez, César

Zdroj: Innovations in Systems & Software Engineering; Jun2025, Vol. 21 Issue 2, p673-686, 14p

DECIDABILITY OF QUERYING FIRST-ORDER THEORIES VIA COUNTERMODELS OF FINITE WIDTH.

Autori: FELLER, THOMAS LYON, TIM S. OSTROPOLSKI-NALEWAJA, PIOTR a ďalší

Zdroj: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 2, p1-53, 53p

Predmety: LOGIC, PICTURES, MEASUREMENT

Initial Limit Datalog:a new extensible class of decidable constrained Horn clauses

Autori: Cathcart Burn, Toby Ong, Luke Ramsay, Steven a ďalší

Zdroj: Cathcart Burn, T, Ong, L, Ramsay, S & Wagner, D 2021, Initial Limit Datalog : a new extensible class of decidable constrained Horn clauses. in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021)., 9470527, Proceedings - Symposium on Logic in Computer Science, vol. 2021-June, Institute of Electrical and Electronics Engineers (IEEE), 2021 36th Annual Symposium on Logic in Computer Science, 29/06/21. https://doi.org/10.1109/LICS52264.2021.9470527

Predmety: /dk/atira/pure/core/keywords/programming_languages, name=Programming Languages

Popis súboru: application/pdf

Relation: urn:ISBN:9781665448956

Dostupnosť: https://hdl.handle.net/1983/13c4eeec-cb82-4f1e-9f85-9ea87fad6889
https://research-information.bris.ac.uk/en/publications/13c4eeec-cb82-4f1e-9f85-9ea87fad6889
https://doi.org/10.1109/LICS52264.2021.9470527
https://research-information.bris.ac.uk/ws/files/271322251/main.pdf

A Correctness and Incorrectness Program Logic.

Autori: BRUNI, ROBERTO GIACOBAZZI, ROBERTO GORI, ROBERTA a ďalší

Zdroj: Journal of the ACM; Apr2023, Vol. 70 Issue 2, p1-45, 45p

Predmety: FALSE alarms, LOGIC

Separating Rank Logic from Polynomial Time.

Autori: LICHTER, MORITZ

Zdroj: Journal of the ACM; Apr2023, Vol. 70 Issue 2, p14-53, 40p

Predmety: POLYNOMIAL time algorithms, LOGIC

On the Descriptive Complexity of Temporal Constraint Satisfaction Problems.

Autori: BODIRSKY, MANUEL RYDVAL, JAKUB

Zdroj: Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-58, 58p

Predmety: CONSTRAINT satisfaction

Whole-grain Petri Nets and Processes.

Autori: KOCK, JOACHIM

Zdroj: Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-58, 58p

Predmety: PETRI nets, SEMANTICS, GROUPOIDS