Sciweavers

7988 search results - page 240 / 1598
» A Useful Undecidable Theory
Sort
View
109
Voted
IFIP
2010
Springer
14 years 7 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro
83
Voted
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
15 years 6 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
86
Voted
KES
1998
Springer
15 years 5 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
203
Voted
AISB
2008
Springer
15 years 2 months ago
Constructivism in AI: Prospects, Progress and Challenges
This position paper argues the case for the application of constructivist theories to Artificial Intelligence, with particular emphasis on Piaget's theory. The idea of buildin...
Frank Guerin
IJCAI
1989
15 years 1 months ago
Sometimes Updates Are Circumscription
Model-based revision of knowledge bases ex­ pressed as first-order theories was shown in [Winslett 88b] to be useful as a means of de­ scribing and reasoning about the effects o...
Marianne Winslett