-
1Academic Journal
Συγγραφείς: Hainry, Emmanuel, Kapron, Bruce, Marion, Jean-Yves, Péchoux, Romain
Συνεισφορές: Hainry, Emmanuel
Πηγή: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. :1-14
Θεματικοί όροι: Declassification, Computer Science - Logic in Computer Science, Type theory, Polynomial time, Basic Feasible Functionals, Theory of computation → Complexity theory and logic, [INFO] Computer Science [cs], Noninterference, Complexity analysis
Περιγραφή αρχείου: application/pdf
-
2Academic Journal
Συγγραφείς: Gokaj, Geri, Künnemann, Marvin
Συνεισφορές: Geri Gokaj and Marvin Künnemann
Θεματικοί όροι: ddc:004, descriptive complexity, presburger arithmetic, DATA processing & computer science, completeness results, k-SUM, fine-grained complexity theory, Theory of computation → Complexity theory and logic
Περιγραφή αρχείου: application/pdf
Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.55
-
3Academic Journal
Συγγραφείς: Hainry, Emmanuel, Péchoux, Romain
Συνεισφορές: Péchoux, Romain
Πηγή: Proceedings of the ACM on Programming Languages. 7:806-832
Θεματικοί όροι: CCS Concepts, Shape Analysis, Computational Complexity, Type theory, Logic and verification Polynomial time, CCS Concepts: Theory of computation → Complexity theory and logic Type theory Logic and verification Polynomial time, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Theory of computation → Complexity theory and logic, [INFO] Computer Science [cs], Noninterference, 01 natural sciences
Περιγραφή αρχείου: application/pdf
-
4Conference
Συγγραφείς: Lichter, Moritz, Raßmann, Simon, Schweitzer, Pascal
Πηγή: Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13 ; 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz ; 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz 33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10 - 2025-02-14
Θεματικοί όροι: Mathematics of computing → Graph algorithms, Theory of computation → Complexity theory and logic, Theory of computation → Problems, reductions and completeness, Weisfeiler-Leman algorithm, coherent configurations, complexity, dimension
Θέμα γεωγραφικό: DE
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-362-1; info:eu-repo/grantAgreement/EC//101054974
-
5Book
Συγγραφείς: Baader, Franz, Giesl, Jürgen
Συνεισφορές: Franz Baader and Jürgen Giesl
Πηγή: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, June, Leibniz international proceedings in informatics 299, 16:1-16:18 (2024). doi:10.4230/LIPICS.FSCD.2024.16
9th International Conference on Formal Structures for Computation and Deduction : FSCD 2024, July 10-13, 2024, Tallinn, Estonia / edited by Jakob Rehof
9th International Conference on Formal Structures for Computation and Deduction : FSCD 2024, July 10-13, 2024, Tallinn, Estonia / edited by Jakob Rehof9. International Conference on Formal Structures for Computation and Deduction, FSCD 2024, Tallinn, Estonia, 2024-07-10-2024-07-13Θεματικοί όροι: Proof rewriting, Rewriting, Theory of computation → Equational logic and rewriting, Confluence, Theory of computation → Automated reasoning, ddc:004, Theory of computation → Complexity theory and logic, Creating small terms, Description Logics, Derivational complexity, Termination
Περιγραφή αρχείου: application/pdf
-
6Book
Συγγραφείς: Lichter, Moritz, Raßmann, Simon, Schweitzer, Pascal
Συνεισφορές: Moritz Lichter and Simon Raßmann and Pascal Schweitzer
Πηγή: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10-2025-02-14Θεματικοί όροι: FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Problems, reductions and completeness, coherent configurations, Computational Complexity (cs.CC), Computer Science - Computational Complexity, dimension, ddc:004, Theory of computation → Complexity theory and logic, complexity, Computer Science - Discrete Mathematics
Περιγραφή αρχείου: application/pdf
-
7Conference
Συγγραφείς: Antonelli, Melissa, Dal Lago, Ugo, Davoli, Davide, Oitavem, Isabel, Pistone, Paolo
Συνεισφορές: Helsinki Institute for Information Technology (HIIT), Helsingin yliopisto = Helsingfors universitet = University of Helsinki-Aalto University, Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO), Languages de Programmation Sécures et Outils pour la Sécurité (SPLITS), Centre Inria d'Université Côte d'Azur, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon, Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Preuves et Langages (PLUME), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon), FCT-Fundação para a Ciência e a Tecnologia, I.P.”, through the projects UIDB/00297/2020 and UIDP/00297/2020 (Center for Mathematics and Applications), Helsinki Institute for Information Technology, ANR-19-CE48-0014,PPS,Sémantique des programmes probabilistes(2019), ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017), European Project: 818616,ERC-2018-COG,ERC-2018-COG,DIAPASoN(2019)
Πηγή: Leibniz International Proceedings in Informatics ; CSL 2024 - 32nd EACSL Annual Conference on Computer Science Logic ; https://hal.science/hal-04777376 ; CSL 2024 - 32nd EACSL Annual Conference on Computer Science Logic, Feb 2024, Napoli, Italy. ⟨10.4230/LIPIcs.CSL.2024.10⟩
Θεματικοί όροι: Implicit Computational Complexity, Theory of computation → Complexity theory and logic, Theory of computation → Proof theory, Theory of computation → Proof theory Bounded Arithmetic, Randomized Computation, Bounded Arithmetic, [INFO]Computer Science [cs]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2311.15003; info:eu-repo/grantAgreement//818616/EU/Differential Program Semantics/DIAPASoN; ARXIV: 2311.15003
-
8Report
Συγγραφείς: Delgrande, James P., Glimm, Birte, Meyer, Thomas, Truszczynski, Miroslaw, Wolter, Frank
Θεματικοί όροι: Computing methodologies → Artificial intelligence, Computing methodologies → Knowledge representation and reasoning, Information systems → Information integration, Theory of computation → Semantics and reasoning, Theory of computation → Complexity theory and logic, Knowledge representation and reasoning, Applications of logics, Formal logic, Declarative representations, Theory of computation → Logic
-
9Academic Journal
Συγγραφείς: Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Paolo Pistone, Isabel Oitavem
Συνεισφορές: Pistone, Paolo, Department of Computer Science, Melissa Antonelli and Ugo Dal Lago and Davide Davoli and Isabel Oitavem and Paolo Pistone
Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer and information sciences, Implicit Computational Complexity, Bounded Arithmetic, Computational Complexity, Measure-Quantified Logics, BPP, Bounded Arithmetic, Mathematics - Logic, F.4.1, F.1.3, Randomized Computation, [INFO] Computer Science [cs], Logic in Computer Science (cs.LO), Theory of computation → Proof theory, Randomized Computation, BPP, Computational Complexity, FOS: Mathematics, Theory of computation → Proof theory Bounded Arithmetic, ddc:004, Theory of computation → Complexity theory and logic, Logic (math.LO)
Περιγραφή αρχείου: application/pdf
Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.15003
https://hal.science/hal-04777376v1/document
https://doi.org/10.4230/lipics.csl.2024.10
https://hal.science/hal-04777376v1
http://hdl.handle.net/10138/570879
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.10
https://hdl.handle.net/11585/928635 -
10Conference
Συγγραφείς: 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), ANR-17-CE40-0028,BRAVAS,IDEAL-BASED ALGORITHMS FOR VASSES AND WELL-STRUCTURED SYSTEMS(2017)
Πηγή: MFCS 2023 ; https://hal.science/hal-04287405 ; MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩
Θεματικοί όροι: 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]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.09881; ARXIV: 2302.09881
-
11Academic Journal
Συγγραφείς: An, Haozhe, Gurumukhani, MohitAff2, IDs0045302201014x_cor2, Impagliazzo, Russell, Jaber, Michael, Künnemann, Marvin, Parga Nina, Maria Paula
Συνδεδεμένο Πλήρες ΚείμενοΠηγή: Algorithmica. :1-36
-
12Conference
Συγγραφείς: van Bergerem, Steffen, Grohe, Martin, Runde, Nina
Συνεισφορές: Humboldt-Universität zu Berlin = Humboldt University of Berlin = Université Humboldt de Berlin (HU Berlin), RWTH Aachen University = Rheinisch-Westfälische Technische Hochschule Aachen (RWTH Aachen), ANR-19-CE48-0019,EQUUS,Réponse efficace aux requêtes sous mises à jour(2019)
Πηγή: Leibniz International Proceedings in Informatics (LIPIcs) ; 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025) ; https://hal.science/hal-04931324 ; 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025), 2025, Amsterdam, Netherlands. ⟨10.4230/LIPIcs.CSL.2025.8⟩
Θεματικοί όροι: fixed-parameter tractable, monadic second-order definable concept learning, agnostic probably approximately correct learning, parameterized complexity, clique-width, Theory of computation → Fixed parameter tractability, Boolean classification, supervised learning, monadic second-order logic, Theory of computation → Logic, Theory of computation → Complexity theory and logic, Computing methodologies → Supervised learning, Computing methodologies → Logical and relational learning, [INFO]Computer Science [cs]
Θέμα γεωγραφικό: Amsterdam, Netherlands
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1909.03820; ARXIV: 1909.03820
-
13Conference
Συγγραφείς: 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)
Πηγή: Computer Science Logic ; https://hal.science/hal-03374648 ; Computer Science Logic, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.10⟩
Θεματικοί όροι: 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]
-
14Conference
Συγγραφείς: Mengel, Stefan
Συνεισφορές: Centre de Recherche en Informatique de Lens (CRIL), Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS), Meel, Kuldeep S. and Strichman, Ofer, Meel, Kuldeep S. and Strichman, Ofer, ANR-18-CE40-0011,PING-ACK,Pré-traitement d'informations pour la résolution de tâches complexes / Compilation avancée de connaissances(2018)
Πηγή: 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⟩Θεματικοί όροι: 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]
-
15Academic Journal
Συγγραφείς: Asimi, Kristina, Barto, Libor, Butti, Silvia
Συνεισφορές: Kristina Asimi and Libor Barto and Silvia Butti, Solnon, Christine
Θεματικοί όροι: FOS: Computer and information sciences, First-Order Logic, Mathematics - Logic, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, FOS: Mathematics, Promise Constraint Satisfaction Problem, Theory of computation → Complexity theory and logic, ddc:004, 0101 mathematics, Logic (math.LO), Model Checking Problem, Multi-Homomorphism
Περιγραφή αρχείου: application/pdf
-
16Conference
Συγγραφείς: van Bergerem, Steffen, Schweikardt, Nicole
Πηγή: Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 183, 10:1-10:18 (2021). doi:10.4230/LIPICS.CSL.2021.10 ; 29th EACSL Annual Conference on Computer Science Logic : CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (virtual conference) / edited by Christel Baier, Jean Goubault-Larrecq ; 29th EACSL Annual Conference on Computer Science Logic : CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (virtual conference) / edited by Christel Baier, Jean Goubault-Larrecq 29. EACSL Annual Conference on Computer Science Logic, CSL 2021, online, 2021-01-25 - 2021-01-28
Θεματικοί όροι: Computing methodologies → Logical and relational learning, Computing methodologies → Supervised learning, Feferman-Vaught decomposition, Gaifman normal form, Theory of computation → Complexity theory and logic, Theory of computation → Logic, agnostic probably approximately correct learning, classification problems, first-order definable concept learning, first-order logic with counting, locality, weight aggregation logic
Θέμα γεωγραφικό: DE
Relation: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-175-7
-
17Conference
Συγγραφείς: Jacobé de Naurois, Paulin
Συνεισφορές: Gouat, Isabelle, Paulin Jacobé de Naurois, Jacobé De Naurois, Paulin
Θεματικοί όροι: [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
Περιγραφή αρχείου: application/pdf
-
18Academic Journal
Συγγραφείς: Anders, Markus
Συνεισφορές: Meel, Kuldeep S., Strichman, Ofer
Θεματικοί όροι: symmetry exploitation, graph isomorphism, Theory of computation → Graph algorithms analysis, Mathematics of computing → Graph algorithms, boolean satisfiability, Theory of computation → Complexity theory and logic
-
19Conference
Συγγραφείς: Berkholz, Christoph, Mengel, Stefan, Wilhelm, Hermann
Συνεισφορές: Technische Universität Ilmenau = Ilmenau University of Technology = Université technique d'Ilmenau Ilmenau, Allemagne (TU), Centre de Recherche en Informatique de Lens (CRIL), Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS), ANR-19-CE48-0019,EQUUS,Réponse efficace aux requêtes sous mises à jour(2019)
Πηγή: Leibniz International Proceedings in Informatics (LIPIcs) ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) ; https://hal.science/hal-04784672 ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Mar 2024, Clermont- Ferrand, France. ⟨10.4230/LIPIcs.STACS.2024.11⟩
Θεματικοί όροι: Theory of computation → Complexity theory and logic, Theory of computation → Constraint and logic programming, DNNF, dichotomy, knowledge compilation, constraint satisfaction, [INFO]Computer Science [cs]
Θέμα γεωγραφικό: Clermont- Ferrand, France
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2311.10040; ARXIV: 2311.10040
-
20Conference
Συγγραφείς: Van Bergerem, Steffen, Schweikardt, Nicole
Συνεισφορές: Steffen van Bergerem and Nicole Schweikardt
Πηγή: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 183, 10:1-10:18 (2021). doi:10.4230/LIPICS.CSL.2021.10
29th EACSL Annual Conference on Computer Science Logic : CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (virtual conference) / edited by Christel Baier, Jean Goubault-Larrecq
29th EACSL Annual Conference on Computer Science Logic : CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (virtual conference) / edited by Christel Baier, Jean Goubault-Larrecq29. EACSL Annual Conference on Computer Science Logic, CSL 2021, online, 2021-01-25-2021-01-28Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Machine Learning, Computer Science - Artificial Intelligence, agnostic probably approximately correct learning, Computing methodologies → Logical and relational learning, 0102 computer and information sciences, 01 natural sciences, Gaifman normal form, Theory of computation → Logic, Logic in Computer Science (cs.LO), Machine Learning (cs.LG), locality, Artificial Intelligence (cs.AI), first-order definable concept learning, weight aggregation logic, first-order logic with counting, ddc:004, 0101 mathematics, Theory of computation → Complexity theory and logic, Feferman-Vaught decomposition, classification problems, Computing methodologies → Supervised learning
Περιγραφή αρχείου: application/pdf
Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2009.10574
https://drops.dagstuhl.de/opus/volltexte/2021/13444/
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-10574
https://drops.dagstuhl.de/opus/volltexte/2021/13444/pdf/LIPIcs-CSL-2021-10.pdf/
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-10574
https://arxiv.org/abs/2009.10574
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.10
https://publications.rwth-aachen.de/record/815149