Results 51 to 60 of about 475,794 (375)
Decidability of Intelligent Systems [PDF]
حکمت و فلسفه, 2008 Intelligent systems are designed on the model of the operation of mind; but they come across, at least, the following problems: (a) Can IS solve every problem?
mohammad ali hijjati +1 more
doaj +1 more source
Trace Refinement in Labelled Markov Decision Processes [PDF]
Logical Methods in Computer Science, 2020 Given two labelled Markov decision processes (MDPs), the trace-refinement problem asks whether for all strategies of the first MDP there exists a strategy of the second MDP such that the induced labelled Markov chains are trace-equivalent.
Nathanaël Fijalkow +2 more
doaj +1 more source
Universality and Almost Decidability [PDF]
Fundamenta Informaticae XXI (2014) 1001-1008, 2015 We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a decidable and generic (i.e. a set of natural density one) set whose intersection with S is decidable.
arxiv +1 more source
On the Path-Width of Integer Linear Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.
Constantin Enea +3 more
doaj +1 more source
What decides the direction of a current? [PDF]
Math. Mech. Compl. Sys. 4 (2016) 275-295, 2016 Nonequilibria show currents that are maintained as the result of a steady driving. We ask here what decides their direction. It is not only the second law, or the positivity of the entropy production that decides; also non-dissipative aspects often matter and sometimes completely decide.
arxiv +1 more source
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet [PDF]
Logical Methods in Computer Science, 2008 We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical characterizations.
Alexis Bès
doaj +1 more source
Decidability of inferring inductive invariants
ACM-SIGACT Symposium on Principles of Programming Languages, 2016 Induction is a successful approach for verification of hardware and software systems. A common practice is to model a system using logical formulas, and then use a decision procedure to verify that some logical formula is an inductive safety invariant ...
Oded Padon +4 more
semanticscholar +1 more source
On Decidability of Hyperbolicity
Combinatorica, 2022 We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
Dvořák, Zdeněk, Postle, Luke
openaire +2 more sources
Decidability of higher-order matching [PDF]
Logical Methods in Computer Science, 2009 We show that the higher-order matching problem is decidable using a game-theoretic argument.
Colin Stirling
doaj +1 more source
Decidability of Trace Equivalence for Protocols with Nonces
IEEE Computer Security Foundations Symposium, 2015 Privacy properties such as anonymity, unlink ability, or vote secrecy are typically expressed as equivalence properties. In this paper, we provide the first decidability result for trace equivalence of security protocols, for an unbounded number of ...
Rémy Chrétien, V. Cortier, S. Delaune
semanticscholar +1 more source