213 search results - page 9 / 43 » Automated Termination Analysis for Logic Programs with Cut |
IANDC
2008
14 years 9 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
TABLEAUX
2007
Springer
15 years 3 months ago
2007
Springer
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with...
LOPSTR
2009
Springer
15 years 4 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...