551 search results - page 13 / 111 » Natural proofs |
CAV
1993
Springer
14 years 2 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
SEMWEB
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Justifications -- that is, minimal entailing subsets of an ontology -- are currently the dominant form of explanation provided by ontology engineering environments, espec...
IFL
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
AIPS
2006
13 years 11 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
ESOP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...