Sciweavers

878 search results - page 117 / 176
» Modelling Communicating Agents in Timed Reasoning Logics
Sort
View
ILP
2005
Springer
15 years 5 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
FSTTCS
2003
Springer
15 years 5 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
ACSW
2003
15 years 1 months ago
A Secure Pervasive Environment
This paper explores the complications encountered when attempting to create a secure pervasive computing environment. The model introduced in this paper is primarily conceptual. T...
Patrick G. McLean
EJC
2010
14 years 6 months ago
Inferencing in Database Semantics
As a computational model of natural language communication, Database Semantics1 (DBS) includes a hearer mode and a speaker mode. For the content to be mapped into language expressi...
Roland Hausser
FOSSACS
2009
Springer
15 years 6 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...