377 search results - page 38 / 76 » Modular logic metaprogramming |
104
click to vote
LOPSTR
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
CADE
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
105
click to vote
CADE
2006
Springer
16 years 3 days ago
2006
Springer
Access-control policies have grown from simple matrices to non-trivial specifications written in sophisticated languages. The increasing complexity of these policies demands corres...
107
click to vote
ICSOC
2004
Springer
15 years 5 months ago
2004
Springer
Over the last few years several process-based web service composition languages have emerged, such as BPEL4WS and BPML. These languages define the composition on the basis of a pr...
AGP
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...