Results 1  10
of
1,403
An undecidability result for AGh
 THEORETICAL COMPUTER SCIENCE
, 2006
"... We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit these properties. We ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit these properties
Abstract An Undecidability Result for AGh
"... We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit these properties. We a ..."
Abstract
 Add to MetaCart
We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit these properties. We
An Undecidability Result for AGh?
, 2006
"... Abstract. We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit these proper ..."
Abstract
 Add to MetaCart
Abstract. We present an undecidability result for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, several recent works relax this assumption, allowing the intruder to exploit
Decidability and Undecidability Results for Planning with . . .
, 2002
"... These days, propositional planning can be considered a quite wellunderstood problem. Good algorithms are known that can solve a wealth of very different and sometimes challenging planning tasks, and theoretical computational properties of both general STRIPSstyle planning and the bestknown b ..."
Abstract
 Add to MetaCart
These days, propositional planning can be considered a quite wellunderstood problem. Good algorithms are known that can solve a wealth of very different and sometimes challenging planning tasks, and theoretical computational properties of both general STRIPSstyle planning and the bestknown benchmark problems have been established. However,
Undecidability results for distributed probabilistic systems
 of Lecture Notes in Computer Science
, 2009
"... Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such events being “the system reaches a failure state”,“a message is delivered”). Such extremal probabilities are obtained by qu ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
in the setting of Markov decision processes. In this paper, we present undecidability results for distributed schedulers. These schedulers were devised in previous works, and aim to capture the fact that each process has partial information about the actual state of the system. Some of the undecidability results
Complexity, Decidability and Undecidability Results for DomainIndependent Planning
 ARTIFICIAL INTELLIGENCE
, 1995
"... In this paper, we examine how the complexity of domainindependent planning with STRIPSstyle operators depends on the nature of the planning operators. We show ..."
Abstract

Cited by 157 (27 self)
 Add to MetaCart
In this paper, we examine how the complexity of domainindependent planning with STRIPSstyle operators depends on the nature of the planning operators. We show
Undecidability Results on TwoVariable Logics
 IN PROCEEDINGS OF 14TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE STACS`97, LECTURE NOTES IN COMPUTER SCIENCE NR. 1200
, 1998
"... It is a classical result of Mortimer that L², firstorder logic with two variables, is decidable for satisfiability. We show that going beyond L² by adding any one of the following leads to an undecidable logic: ffl very weak forms of recursion, viz. (i) transitive closure operations (ii) (restrict ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
It is a classical result of Mortimer that L², firstorder logic with two variables, is decidable for satisfiability. We show that going beyond L² by adding any one of the following leads to an undecidable logic: ffl very weak forms of recursion, viz. (i) transitive closure operations (ii
Decidability and Undecidability Results for Propositional Schemata
"... We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over intervals parameterized by arithmetic variables (e.g., ∧n i=1 pi, where n is a parameter). The satisfiability problem is shown ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
to be undecidable for this new logic, but we introduce a very general class of schemata, called boundlinear, for which this problem becomes decidable. This result is obtained by reduction to a particular class of schemata called regular, for which we provide a sound and complete terminating proof procedure
An undecidability result on limits of sparse graphs
"... Given a set B of finite rooted graphs and a radius r as an input, we prove that it is undecidable to determine whether there exists a sequence (Gi) of finite bounded degree graphs such that the rooted rradius neighbourhood of a random node of Gi is isomorphic to a rooted graph in B with probability ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a set B of finite rooted graphs and a radius r as an input, we prove that it is undecidable to determine whether there exists a sequence (Gi) of finite bounded degree graphs such that the rooted rradius neighbourhood of a random node of Gi is isomorphic to a rooted graph in B
An Undecidability Result Concerning Periodic Morphisms
"... The following universe problem for the equality sets is shown to be undecidable: given a weak coding h, and two morphisms g 1 ; g 2 , where g 2 is periodic, determine whether or not h(EG (g 1 ; g 2 )) = ..."
Abstract
 Add to MetaCart
The following universe problem for the equality sets is shown to be undecidable: given a weak coding h, and two morphisms g 1 ; g 2 , where g 2 is periodic, determine whether or not h(EG (g 1 ; g 2 )) =
Results 1  10
of
1,403