Sciweavers

756 search results - page 136 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
FORMATS
2009
Springer
14 years 3 days ago
Safe Runtime Verification of Real-Time Properties
Abstract. Introducing a monitor on a system typically changes the system's behaviour by slowing the system down and increasing memory consumption. This may possibly result in ...
Christian Colombo, Gordon J. Pace, Gerardo Schneid...
ASC
2006
13 years 9 months ago
A WAM implementation for flexible query answering
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similar...
Pascual Julián Iranzo, Clemente Rubio-Manza...
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 8 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
FC
2010
Springer
169views Cryptology» more  FC 2010»
13 years 11 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
14 years 1 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart