850 search results - page 70 / 170 » A Logic Programming Language Based on Binding Algebras |
205
click to vote
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
107
click to vote
ILP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Logical Bayesian Networks (LBNs) have recently been introduced as another language for knowledge based model construction of Bayesian networks, besides existing languages...
125
click to vote
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
232
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...