213 search results - page 20 / 43 » Automated Termination Analysis for Logic Programs with Cut |
JLP
1998
15 years 1 months ago
1998
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
CAV
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
123
click to vote
LOPSTR
2001
Springer
15 years 5 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...
120
click to vote
LOPSTR
2001
Springer
15 years 5 months ago
2001
Springer
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...
143
click to vote
ECSQARU
2005
Springer
15 years 7 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...