Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Bentkamp, Alexander"'
Numerical and symbolic methods for optimization are used extensively in engineering, industry, and finance. Various methods are used to reduce problems of interest to ones that are amenable to solution by such software. We develop a framework for des
Externí odkaz:
http://arxiv.org/abs/2301.09347
We present a tool for verification of hybrid systems expressed in the sequential fragment of HCSP (Hybrid Communicating Sequential Processes). The tool permits annotating HCSP programs with pre- and postconditions, invariants, and proof rules for rea
Externí odkaz:
http://arxiv.org/abs/2210.17163
Publikováno v:
Proceedings on Privacy Enhancing Technologies 3 (2022) 222-246
Differential privacy (DP) is a widely used notion for reasoning about privacy when publishing aggregate data. In this paper, we observe that certain DP mechanisms are amenable to a posteriori privacy analysis that exploits the fact that some outputs
Externí odkaz:
http://arxiv.org/abs/2205.03470
In 1982, Raymond Smullyan published an article, "The Asylum of Doctor Tarr and Professor Fether," that consists of a series of puzzles. These were later reprinted in the anthology, "The Lady or The Tiger? and Other Logic Puzzles." The last puzzle, wh
Externí odkaz:
http://arxiv.org/abs/2112.02142
Autor:
Bentkamp, Alexander, Avigad, Jeremy
Optimization is used extensively in engineering, industry, and finance, and various methods are used to transform problems to the point where they are amenable to solution by numerical methods. We describe progress towards developing a framework, bas
Externí odkaz:
http://arxiv.org/abs/2111.06807
Autor:
BENTKAMP, ALEXANDER1, BLANCHETTE, JASMIN2, NUMMELIN, VISA3, TOURRET, SOPHIE4, VUKMIROVIĆ, PETAR3, WALDMANN, UWE5
Publikováno v:
Communications of the ACM. Apr2023, Vol. 66 Issue 4, p80-90. 11p. 2 Color Photographs, 2 Diagrams, 1 Chart.
We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $\beta\eta$-equivalence classes of $\lambda$-terms and rely
Externí odkaz:
http://arxiv.org/abs/2102.00453
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 4 (December 14, 2021) lmcs:6919
We developed a procedure to enumerate complete sets of higher-order unifiers based on work by Jensen and Pietrzykowski. Our procedure removes many redundant unifiers by carefully restricting the search space and tightly integrating decision procedure
Externí odkaz:
http://arxiv.org/abs/2011.09507
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 2 (April 12, 2021) lmcs:6455
We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a term order t
Externí odkaz:
http://arxiv.org/abs/2005.02094
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.