12774 search results - page 106 / 2555 » A Framework for Proof Systems |
123
click to vote
AAAI
1990
15 years 5 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...
164
click to vote
LISP
2008
15 years 4 months 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...
142
click to vote
JELIA
2004
Springer
15 years 9 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...
131
click to vote
FMOODS
2003
15 years 5 months ago
2003
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several ca...
110
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents a formalized proof of a discrete form of the Jordan Curve Theorem. It is based on a hypermap model of planar subdivisions, formal specifications and proofs assi...