Filters








43,594 Hits in 6.0 sec

Algorithmic Data Science (Invited Talk)

Petra Mutzel, Michael Wagner
2019 Symposium on Theoretical Aspects of Computer Science  
ACM Subject Classification Theory of computation → Design and analysis of algorithms; Theory of computation → Graph algorithms analysis; Theory of computation → Complexity theory and logic; Mathematics  ...  The area of algorithmic data science provides new opportunities for researchers in the algorithmic community.  ...  In particular, the author provides intuition for the presented statistical and mathematical concepts.  ... 
doi:10.4230/lipics.stacs.2019.3 dblp:conf/stacs/Mutzel19 fatcat:4sq6azx2snb2tkhr4n5wchaoyq

Trustworthy Graph Algorithms (Invited Talk)

Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow, Michael Wagner
2019 International Symposium on Mathematical Foundations of Computer Science  
The goal of the LEDA project was to build an easy-to-use and extendable library of correct and efficient data structures, graph algorithms and geometric algorithms.  ...  ACM Subject Classification Theory of computation → Design and analysis of algorithms; Software and its engineering → Formal software verification; Software and its engineering → Software libraries and  ...  Introduction This talk is a follow-up on two previous invited MFCS-talks given by the second author: LEDA: A Library of Efficient Data Types and Algorithms in MFCS 1989 [31] , and From Algorithms to Working  ... 
doi:10.4230/lipics.mfcs.2019.1 dblp:conf/mfcs/AbdulazizMN19 fatcat:snqxwpdi4fg3llav2wxstssdfq

Mechanized Reasoning for Continuous Problem Domains (Invited Talk)

Rob Arthan
2008 Conference on Automated Deduction  
I conclude with an overview of some recent new results on decidability and undecidability for vector spaces and related theories.  ...  Specification and verification in continuous problem domains are key topics for the practical application of formal methods and mechanized reasoning.  ...  Acknowledgments I thank Colin O'Halloran and Nick Tudor of QinetiQ for encouraging and informing my interest in control systems.  ... 
dblp:conf/cade/Arthan08 fatcat:crgpwhu5ovabrfaizerkszgf3e

Certifying the Weighted Path Order (Invited Talk)

René Thiemann, Jonas Schöpf, Christian Sternagel, Akihisa Yamada, Zena M. Ariola
2020 International Conference on Formal Structures for Computation and Deduction  
In this work, we increase the reliability of these automatically generated proofs.  ...  The weighted path order (WPO) unifies and extends several termination proving techniques that are known in term rewriting.  ...  ," and if yes (2) "Is NaTT's implementation of the theory correct?".  ... 
doi:10.4230/lipics.fscd.2020.4 dblp:conf/fscd/ThiemannSS020 fatcat:gmjshpek6jbapdyzf6dhtoc27i

Constraint Modelling: A Challenge for First Order Automated Reasoning (Invited Talk)

John K. Slaney
2008 Conference on Automated Deduction  
In this talk, I survey the opportunities arising from this new application direction for automated deduction, and note some of the formidable obstacles in the way of a practically useful implementation  ...  The process of modelling a problem in a form suitable for solution by constraint satisfaction or operations research techniques, as opposed to the process of solving it once formulated, requires a significant  ...  1 We have benefitted greatly from being in a team that has included Michael Norrish, Rajeev Gore, Jeremy Dawson, Jia Meng, Anbulagan and Jinbo Huang, and from the presence in the same laboratory of an  ... 
dblp:conf/cade/Slaney08 fatcat:an6uqbvbfvhpfmazobkpyhpevu

The Gremlin graph traversal machine and language (invited talk)

Marko A. Rodriguez
2015 Proceedings of the 15th Symposium on Database Programming Languages - DBPL 2015  
This article provides a mathematical description of Gremlin and details its automaton and functional properties.  ...  Gremlin, as a graph traversal language, is a functional language implemented in the user's native programming language and is used to define the Ψ of a Gremlin machine.  ...  Acknowledgments The Apache TinkerPop project (http://tinkerpop.com) was started in November 2009 and is currently in its third generation of development with TinkerPop3 having been released in July of  ... 
doi:10.1145/2815072.2815073 dblp:conf/dbpl/Rodriguez15 fatcat:iuhgtnevone3nhphtqk4w3w6bu

Admissibility in Games with Imperfect Information (Invited Talk)

Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur, Marc Herbstritt
2017 International Conference on Concurrency Theory  
Depending on the type of dominance used (weak dominance, dominance, strict dominance) and the number of distinct payoffs, these problems were shown to be complete for L, NL, P or NP in [23, 15, 20, 8]  ...  Structure of the paper In Section 3, we discuss the existence of admissible strategies in two player win/lose infinite sequential games with imperfect information.  ...  Player 2 perfectly informed As we mentioned following Theorem 20, in regular games the validity of the condition in the theorem depends only on the set of last vertices in the histories forming a monochromatic  ... 
doi:10.4230/lipics.concur.2017.2 dblp:conf/concur/BrenguierPRS17 fatcat:7hjalaiyxjc6fgtyozmbj2iidu

Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk)

Mitsuhiro Okada, Marc Herbstritt
2013 International Conference on Rewriting Techniques and Applications  
the use of imaginaries in mathematics, which was an important issue in the foundations of mathematics in the period.  ...  ) structure, the core part of which is a "convergent" term rewrite proof structure.  ...  This version of the paper is prepared for an invited talk at the 24th International Conference on Rewriting Techniques and its Applications (RTA2013).  ... 
doi:10.4230/lipics.rta.2013.4 dblp:conf/rta/Okada13 fatcat:tmsq4cs23zformwqgmoipb3rr4

Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)

Jasmin Christian Blanchette
2019 Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019  
IsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at developing formal theories about logics, proof systems, and automatic provers, using Isabelle/HOL.  ...  At the heart of the project is the conviction that proof assistants have become mature enough to actually help researchers in automated reasoning when they develop new calculi and tools.  ...  We have started looking into extending IsaSAT with theory reasoning, as in an SMT (satisfiability-modulo-theories) solver, with the goal of integrating it in CeTA [24] , a verified safety and termination  ... 
doi:10.1145/3293880.3294087 dblp:conf/cpp/Blanchette19 fatcat:n7delklh2nejvh4zspbcljamwy

Efficient certification of complexity proofs: formalizing the Perron–Frobenius theorem (invited talk paper)

Jose Divasón, Sebastiaan Joosten, Ondřej Kunčar, René Thiemann, Akihisa Yamada
2018 Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018  
This connection crucially relies on the transfer mechanism in combination with local type definitions, being a non-trivial case study for these Isabelle tools.  ...  In this work we formalize the Perron-Frobenius theorem.  ...  The authors are listed in alphabetical order regardless of individual contributions or seniority. We thank Fabian Immler for his explanations on how to perform continuity proofs in the HMA library.  ... 
doi:10.1145/3176245.3167103 fatcat:dbeagv66k5gttinzjqhw6xnzbu

Efficient certification of complexity proofs: formalizing the Perron–Frobenius theorem (invited talk paper)

Jose Divasón, Sebastiaan Joosten, Ondřej Kunčar, René Thiemann, Akihisa Yamada
2018 Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018  
This connection crucially relies on the transfer mechanism in combination with local type definitions, being a non-trivial case study for these Isabelle tools.  ...  In this work we formalize the Perron-Frobenius theorem.  ...  The authors are listed in alphabetical order regardless of individual contributions or seniority. We thank Fabian Immler for his explanations on how to perform continuity proofs in the HMA library.  ... 
doi:10.1145/3167103 dblp:conf/cpp/DivasonJKT018 fatcat:niku3pjyhvdhfchc6p2ikanrua

Dialectica Comonads (Invited Talk)

Valeria de Paiva, Fabio Gadducci, Alexandra Silva
2021
operator in dialectica categories.  ...  This composition of comonads evokes some work on stateful games by Laird and others, also discussed in the setting of Reddy's system LLMS (Linear Logic Model of State).  ...  I have started the talk, that is now written as this note, with a quote from Martin Hyland in "Proof Theory in the Abstract" [18] .  ... 
doi:10.4230/lipics.calco.2021.3 fatcat:gm4mrko2jjfwjij3afbgqtcln4

Duality in Action (Invited Talk)

Paul Downen, Zena M. Ariola, Naoki Kobayashi
2021
We show how this duality can be put to use in the theory and practice of programming languages and their implementations, too.  ...  The side where this simplification applies depends on the type of the structure in question.  ...  Introduction Mathematical logic, through the Curry-Howard correspondence [25] , has undoubtably proved its usefulness in the theory of computation and programming languages.  ... 
doi:10.4230/lipics.fscd.2021.1 fatcat:orleuqoeefcm5mjs5m5mrlpifu

Optimization, Complexity and Invariant Theory (Invited Talk)

Peter Bürgisser, Markus Bläser, Benjamin Monmege
2021
Invariant and representation theory studies symmetries by means of group actions and is a well established source of unifying principles in mathematics and physics.  ...  We also point out surprising connections to a diverse set of problems in different areas of mathematics, statistics, computer science, and physics.  ...  Another type of connections are of purely structural open problems solved through such geodesic algorithms, reasserting the importance of the computational lens in mathematics.  ... 
doi:10.4230/lipics.stacs.2021.1 fatcat:z3clletuefe4zd6v5kiblvmxva

Error Resilient Space Partitioning (Invited Talk)

Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, Ran J. Tessler, Nikhil Bansal, Emanuela Merelli, James Worrell
2021
In this paper we consider a new type of space partitioning which bridges the gap between continuous and discrete spaces in an error resilient way.  ...  Minimizing this revealed information can be particularly important in privacy-sensitive applications such as COVID-19 contact tracing, in which we want to find out all the cases in which two persons were  ...  and each type of partition has different properties and applications within computer science, electrical engineering, and applied mathematics.  ... 
doi:10.4230/lipics.icalp.2021.4 fatcat:op3plilqjvd5bajcvxnekmde5m
« Previous Showing results 1 — 15 out of 43,594 results