Výsledky vyhledávání - 2012 ACM Subject Classification Theory of computation → Complexity theory and logic

Ordinal measures of the set of finite multisets

Autoři: Vialard, Isa Laboratoire Méthodes Formelles (LMF) Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay) a další

Přispěvatelé: Vialard, Isa Laboratoire Méthodes Formelles (LMF) Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay) a další

Zdroj: MFCS 2023 ; https://hal.science/hal-04287405 ; MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩

Témata: Well-partial order, program verification, termination, finite multisets, Theory of computation → Program reasoning, Theory of computation → Proof theory, Theory of computation → Logic and verification, 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, [INFO]Computer Science [cs]

Geografické téma: Bordeaux, France

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.09881; ARXIV: 2302.09881

Dostupnost: https://hal.science/hal-04287405
https://hal.science/hal-04287405v1/document
https://hal.science/hal-04287405v1/file/multiset.pdf
https://doi.org/10.4230/LIPIcs

Changing Partitions in Rectangle Decision Lists

Autoři: Mengel, Stefan Centre de Recherche en Informatique de Lens (CRIL) Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS) a další

Přispěvatelé: Mengel, Stefan Centre de Recherche en Informatique de Lens (CRIL) Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS) a další

Zdroj: 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
https://hal.science/hal-03864946
25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), Meel, Kuldeep S. and Strichman, Ofer, Aug 2022, Haifa, Israel. pp.17:1--17:20, ⟨10.4230/LIPIcs.SAT.2022.17⟩

Témata: 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, Theory of computation → Proof complexity phrases rectangle decision lists, QBF proof complexity, OBDD, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geografické téma: Haifa, Israel

Dostupnost: https://hal.science/hal-03864946
https://hal.science/hal-03864946v1/document
https://hal.science/hal-03864946v1/file/orders.pdf
https://doi.org/10.4230/LIPIcs.SAT.2022.17

Parallelism in Soft Linear Logic

Autoři: Jacobé de Naurois, Paulin Laboratoire d'Informatique de Paris-Nord (LIPN) Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)

Přispěvatelé: Jacobé de Naurois, Paulin Laboratoire d'Informatique de Paris-Nord (LIPN) Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)

Zdroj: Computer Science Logic ; https://hal.science/hal-03374648 ; Computer Science Logic, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.10⟩

Témata: 2012 ACM Subject Classification Theory of computation → Linear logic, Theory of computation → Complexity theory and logic phrases Implicit Complexity, Typing, Linear Logic, Functional Programming, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geografické téma: Göttingen, Germany

Dostupnost: https://hal.science/hal-03374648
https://hal.science/hal-03374648v1/document
https://hal.science/hal-03374648v1/file/PSLL-CSL%20-%20Final.pdf
https://doi.org/10.4230/LIPIcs.10

A Complexity Approach to Tree Algebras: the Polynomial Case

Autoři: Colcombet, Thomas Jaquard, Arthur Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) a další

Přispěvatelé: Colcombet, Thomas Jaquard, Arthur Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) a další

Zdroj: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
https://hal.science/hal-03820478
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Aug 2022, Vienna, Austria. pp.1868-8969, ⟨10.4230/LIPIcs.MFCS.2022.37⟩
https://ac.tuwien.ac.at/mfcs2022/

Témata: 2012 ACM Subject Classification Theory of computation → Tree languages, nominal automata, language theory, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: Vienna, Austria

Relation: info:eu-repo/grantAgreement//670624/EU/Duality in Formal Languages and Logic - a unifying approach to complexity and semantics/DuaLL

Dostupnost: https://hal.science/hal-03820478
https://hal.science/hal-03820478v1/document
https://hal.science/hal-03820478v1/file/LIPIcs-MFCS-2022-37.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2022.37

A Complexity Approach to Tree Algebras: the Bounded Case

Autoři: Colcombet, Thomas Jaquard, Arthur Centre National de la Recherche Scientifique (CNRS) a další

Přispěvatelé: Colcombet, Thomas Jaquard, Arthur Centre National de la Recherche Scientifique (CNRS) a další

Zdroj: International Colloquium on Automata, Languages, and Programming, ICALP ; https://hal.science/hal-03473726 ; International Colloquium on Automata, Languages, and Programming, ICALP, 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.127⟩

Témata: 2012 ACM Subject Classification Theory of computation → Tree languages, Theory of computation → Regular languages phrases Tree algebra, infinite tree, language theory Digital Object Identifier 10.4230/LIPIcs.ICALP.2021.127 Category Track B: Automata, Logic, Semantics, and Theory of Programming, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: Glasgow, United Kingdom

Relation: info:eu-repo/grantAgreement//670624/EU/Duality in Formal Languages and Logic - a unifying approach to complexity and semantics/DuaLL

Dostupnost: https://hal.science/hal-03473726
https://hal.science/hal-03473726v1/document
https://hal.science/hal-03473726v1/file/LIPIcs-ICALP-2021-127%284%29.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2021.127

Parallelism in Soft Linear Logic

Autoři: Jacobé de Naurois, Paulin Gouat, Isabelle Paulin Jacobé de Naurois a další

Přispěvatelé: Jacobé de Naurois, Paulin Gouat, Isabelle Paulin Jacobé de Naurois a další

Témata: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], 2012 ACM Subject Classification Theory of computation → Linear logic, Theory of computation → Complexity theory and logic phrases Implicit Complexity, Implicit Complexity, Functional Programming, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], ddc:004, Typing, Linear Logic

Popis souboru: application/pdf

Přístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271468v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.26
https://hal.science/hal-03374648v1
https://doi.org/10.4230/lipics...10
https://hal.science/hal-03374648v1/document

New Lower Bounds for Reachability in Vector Addition Systems

Autoři: Czerwiński, Wojciech Jecker, Ismaël Lasota, Sławomir a další

Přispěvatelé: Czerwiński, Wojciech Jecker, Ismaël Lasota, Sławomir a další

Zdroj: FSTTCS ; https://hal.science/hal-04782385 ; FSTTCS, Dec 2023, Telangana, India. pp.35:1--35:22, ⟨10.4230/LIPICS.FSTTCS.2023.35⟩

Témata: Theory of computation → Logic and verification, Theory of computation → Verification by model checking, Theory of computation → Concurrency, lower bounds, vector addition systems, lower bounds Digital Object Identifier 10.4230/LIPIcs.STACS.2022.35, pushdown vector addition system, reachability problem, Theory of computation vector addition systems, Theory of computation vector addition systems reachability problem pushdown vector addition system lower bounds Digital Object Identifier 10.4230/LIPIcs.STACS.2022.35, 2012 ACM Subject Classification Theory of computation → Concurrency, [INFO]Computer Science [cs]

Geografické téma: Telangana, India

Dostupnost: https://hal.science/hal-04782385
https://hal.science/hal-04782385v1/document
https://hal.science/hal-04782385v1/file/2d.pdf
https://doi.org/10.4230/LIPICS.FSTTCS.2023.35

Efficient Construction of Reversible Transducers from Regular Transducer Expressions

Autoři: Gastin, Paul Dartois, Luc Govind, R. a další

Přispěvatelé: Gastin, Paul Dartois, Luc Govind, R. a další

Zdroj: 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ’22)
https://hal.science/hal-03772628
37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ’22), Aug 2022, Haifa, Israel

Témata: Reversible transducers, Rational expressions, regular functions, 2012 ACM Subject Classification Theory of computation -> Transducers, [INFO]Computer Science [cs], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Geografické téma: Haifa, Israel

Dostupnost: https://hal.science/hal-03772628
https://hal.science/hal-03772628v1/document
https://hal.science/hal-03772628v1/file/2202.04340.pdf

On the Succinctness of Alternating Parity Good-for-Games Automata

Autoři: Boker, Udi Kuperberg, Denis Lehtinen, Karoliina a další

Přispěvatelé: Boker, Udi Kuperberg, Denis Lehtinen, Karoliina a další

Zdroj: FSTTCS 2020 ; https://hal.science/hal-03046213 ; FSTTCS 2020, Dec 2020, Goa, India. pp.41:1--41:13, ⟨10.4230/LIPIcs.FSTTCS.2020.41⟩

Témata: 2012 ACM Subject Classification Theory of computation → Logic and verification phrases Good for games, history-determinism, alternation, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Geografické téma: Goa, India

Dostupnost: https://hal.science/hal-03046213
https://hal.science/hal-03046213v1/document
https://hal.science/hal-03046213v1/file/2009.14437%20%281%29.pdf
https://doi.org/10.4230/LIPIcs.FSTTCS.2020.41

Deciding the existence of cut-off in parameterized rendez-vous networks

Autoři: Horn F. Sangnier A. Horn, Florian a další

Přispěvatelé: Horn F. Sangnier A. Horn, Florian a další

Témata: FOS: Computer and information sciences, Cut-offs, Computer Science - Logic in Computer Science, Verification, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 16. Peace & justice, 7. Clean energy, 01 natural sciences, Logic in Computer Science (cs.LO), 0202 electrical engineering, electronic engineering, information engineering, Parameterized networks, ddc:004, 2012 ACM Subject Classification Theory of computation → Concurrency phrases Parameterized networks

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2007.05789
https://hal.science/hal-03457885v1
https://hal.science/hal-03457885v1/document
https://doi.org/10.4230/lipics.concur.2020.46
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.46

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems

Autoři: Akshay, S. Bazille, Hugo Genest, Blaise a další

Přispěvatelé: Akshay, S. Bazille, Hugo Genest, Blaise a další

Zdroj: https://hal.science/hal-03850362 ; 2022.

Témata: 2012 ACM Subject Classification Theory of computation, Logic and verification phrases Skolem problem, verification, dynamical systems, robustness, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2211.02365; ARXIV: 2211.02365

Dostupnost: https://hal.science/hal-03850362
https://hal.science/hal-03850362v1/document
https://hal.science/hal-03850362v1/file/ABGV22.pdf
https://doi.org/10.4230/LIPIcs.STACS.2022.51

Verification of Flat FIFO Systems

Autoři: Finkel, Alain Praveen, M. Laboratoire Spécification et Vérification Cachan (LSV) a další

Přispěvatelé: Finkel, Alain Praveen, M. Laboratoire Spécification et Vérification Cachan (LSV) a další

Zdroj: CONCUR 2019 ; https://hal.science/hal-02267453 ; CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands

Témata: reachability, FIFO, termination, Infinite state systems, complexity, flat systems, counters, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: AMSTERDAM, Netherlands

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1908.07282; ARXIV: 1908.07282

Dostupnost: https://hal.science/hal-02267453
https://hal.science/hal-02267453v1/document
https://hal.science/hal-02267453v1/file/flat.pdf

Research on the classification of EEG signals for dementia and its interpretability using the GWOCS agorithm.

Autoři: Wang, Ruofan Xu, Haojie Ma, Yijia a další

Zdroj: Cognitive Neurodynamics; 11/10/2025, Vol. 20 Issue 1, p1-30, 30p

Contextualization, Procedural Logic, and Active Construction: A Cognitive Scaffolding Model for Topic Sentiment Analysis in Game-Based Learning.

Autoři: Ding, Liwei Zhang, Hongfeng Zhou, Jinqiao a další

Zdroj: Behavioral Sciences (2076-328X); Oct2025, Vol. 15 Issue 10, p1327, 22p

Computational Infrastructure for Modern Greek: From Grammar to Ontology.

Autoři: Samaridi, Nikoletta E. Karanikolas, Nikitas N. Papakitsos, Evangelos C. a další

Zdroj: Computation; Nov2025, Vol. 13 Issue 11, p272, 27p

Témata: GRAMMAR, ONTOLOGY, NATURAL language processing, INFORMATION storage & retrieval systems, CONCEPTUAL structures, GREEK language, PHILOSOPHY of language

The Problem-Ladenness of Theory.

Autoři: Levenstein, Daniel De Santo, Aniello Heijnen, Saskia a další

Zdroj: Computational Brain & Behavior; Dec2024, Vol. 7 Issue 4, p548-571, 24p

Foundations of Software Science and Computation Structures : 28th International Conference, FoSSaCS 2025, Held As Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, May 3–8, 2025, Proceedings

Autoři: Parosh Aziz Abdulla Delia Kesner

Resource Type: eBook.

Témata: Computer software--Congresses, Software engineering--Congresses

Categories: COMPUTERS / Computer Science, COMPUTERS / Computer Architecture, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Applied, MATHEMATICS / Logic

Foundations of Software Science and Computation Structures

Autoři: Patricia Bouyer Lutz Schröder

Resource Type: eBook.

Témata: Information theory, Software engineering--Congresses, Computer software--Congresses, Computer systems

Categories: COMPUTERS / Computer Science, COMPUTERS / Computer Architecture, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Applied, MATHEMATICS / Logic

A Taxonomy of Neuroscientific Strategies Based on Interaction Orders.

Autoři: Neri M Brovelli A Castro S a další

Zdroj: The European journal of neuroscience [Eur J Neurosci] 2025 Feb; Vol. 61 (3), pp. e16676.

Způsob vydávání: Journal Article; Review

Informace o časopise: Publisher: Wiley-Blackwell Country of Publication: France NLM ID: 8918110 Publication Model: Print Cited Medium: Internet ISSN: 1460-9568 (Electronic) Linking ISSN: 0953816X NLM ISO Abbreviation: Eur J Neurosci Subsets: MEDLINE

Výrazy ze slovníku MeSH: Brain*/physiology , Neurosciences*/methods , Neurosciences*/classification , Neurons*/physiology , Cognition*/physiology , Models, Neurological* , Nerve Net*/physiology, Humans ; Animals

Socializing AI: Integrating Social Network Analysis and Deep Learning for Precision Dairy Cow Monitoring—A Critical Review.

Autoři: Parivendan, Sibi Chakravathy Sailunaz, Kashfia Neethirajan, Suresh

Zdroj: Animals (2076-2615); Jul2025, Vol. 15 Issue 13, p1835, 48p

Témata: ARTIFICIAL intelligence, DEEP learning, ETHICAL problems, PRECISION farming, DAIRY cattle, SOCIAL network analysis, ANIMAL welfare, SCIENTIFIC observation