Sciweavers

590 search results - page 10 / 118
» Non-Failure Analysis for Logic Programs
Sort
View
WCRE
2009
IEEE
14 years 2 months ago
The Logical Modularity of Programs
Abstract—The principles and best practices of object oriented design require that modules in a program should match logical decomposition of the knowledge that the program implem...
Daniel Ratiu, Radu Marinescu, Jan Jürjens
LOPSTR
2009
Springer
14 years 2 months ago
The Dependency Triple Framework for Termination of Logic Programs
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
Peter Schneider-Kamp, Jürgen Giesl, Manh Than...
LOPSTR
2001
Springer
13 years 12 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
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...
Giorgio Delzanno, Sandro Etalle
LOPSTR
2001
Springer
13 years 12 months ago
Computing Environment-Aware Agent Behaviours with Logic Program Updates
Abstract. The ability of reacting to changes in the external environment is of crucial importance within the context of software agents. Such feature must however be suitably recon...
José Júlio Alferes, Antonio Brogi, J...
UC
2009
Springer
14 years 2 months ago
Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
Frédéric Prost, Chaouki Zerrari