Sciweavers

551 search results - page 86 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
14 years 25 days ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
CODES
1999
IEEE
14 years 24 days ago
System synthesis utilizing a layered functional model
We propose a system synthesis method which bridges the gap between a highly abstract functional model and an efficient hardware or software implementation. The functional model is...
Ingo Sander, Axel Jantsch
ICLP
1999
Springer
14 years 23 days ago
Event, Property, and Hierarchy in Order-Sorted Logic
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could c...
Ken Kaneiwa, Satoshi Tojo
KI
1999
Springer
14 years 22 days ago
On the Translation of Qualitative Spatial Reasoning Problems into Modal Logics
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A...
Werner Nutt
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
14 years 22 days ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...