110 search results - page 5 / 22 » A Tutorial on Proof Theoretic Foundations of Logic Programmi... |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
ATAL
1995
Springer
13 years 11 months ago
1995
Springer
This paper describes a novel approach to high-level agent programming based on a highly developed logical theory of action. The user provides a specification of the agents’ bas...
CADE
2003
Springer
14 years 7 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
LOPSTR
2001
Springer
13 years 12 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...
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...