1894 search results - page 64 / 379 » A TLA Proof System |
99
Voted
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
97
Voted
AAAI
1990
15 years 1 months ago
1990
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
128
Voted
LISP
2008
15 years 19 days ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
129
Voted
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verified in Isabelle/HOL. The framework defines and proves sound a verification con...
115
Voted
JELIA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...