Results 11 to 20 of about 11,242,110 (313)
Non determinism through type isomorphism [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
Alejandro Díaz-Caro, Gilles Dowek
doaj +4 more sources
Catalytic Space: Non-determinism and Hierarchy [PDF]
Theory of Computing Systems, 2017 Catalytic computation, defined by Buhrman, Cleve, Koucký, Loff and Speelman (STOC 2014), is a space-bounded computation where in addition to our working memory we have an exponentially larger auxiliary memory which is full; the auxiliary memory may be ...
H. Buhrman +3 more
semanticscholar +7 more sources
The Combinatorics of Non-determinism
Foundations of Software Technology and Theoretical Computer Science, 2013 A deep connection exists between the interleaving semantics of concurrent processes and increasingly labelled combinatorial structures. In this paper we further explore this connection by studying the rich combinatorics of partially increasing structures
O. Bodini +2 more
semanticscholar +5 more sources
Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages, 2015 Non-deterministic computations are conventionally modelled by lists of their outcomes. This approach provides a concise declarative description of certain problems, as well as a way of generically solving such problems.However, the traditional approach falls short when the non-deterministic problem is allowed to be recursive: the recursive problem may ...
Alexander Vandenbroucke +2 more
semanticscholar +3 more sources
Assessment of feasibility of projects for creating information and management systems of the electric power complex under conditions of uncertainty [PDF]
E3S Web of Conferences, 2023 Evaluating the feasibility of implementing proposed projects for creating information management systems (IMS) for industrial facilities is a complex procedure due to the uncertainty surrounding the accurate data about the prepared project during its ...
Bayramov I Y, Isayeva T M, Maliyeva S I
doaj +1 more source
Towards Races in Linear Logic [PDF]
Logical Methods in Computer Science, 2020 Process calculi based in logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races.
Wen Kokke +2 more
doaj +1 more source
Linearity, Non-determinism and Solvability [PDF]
Fundamenta Informaticae, 2010 We study the notion of solvability in the resource calculus, an extension of the λ-calculus modelling resource consumption. Since this calculus is non-deterministic, two different notions of solvability arise, one optimistic (angelical, may) and one pessimistic (demoniac, must).
Pagani, Michele +1 more
openaire +3 more sources
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) [PDF]
Logical Methods in Computer Science, 2023 We study encodings of the lambda-calculus into the pi-calculus in the unexplored case of calculi with non-determinism and failures. On the sequential side, we consider lambdafail, a new non-deterministic calculus in which intersection types control ...
Joseph W. N. Paulus +2 more
doaj +1 more source
Non-Determinism and the Dynamics of Knowledge [PDF]
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017 In this paper we attempt to shed light on the concept of an agent’s knowledge after a non-deterministic action is executed. We start by making a comparison between notions of non-deterministic choice, and between notions of sequential composition, of settings with dynamic and/or epistemic character; namely Propositional Dynamic Logic (PDL), Dynamic ...
Davide Grossi +3 more
semanticscholar +4 more sources
Non-Determinism and Nash Equilibria for Sequential Game over Partial Order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium.
Stéphane Le Roux
doaj +1 more source