10568 search results - page 498 / 2114 » Computer Intelligence and Formalization |
136
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We introduce a modular framework for formalizing reasoning with incomplete and inconsistent information. This framework is composed of non-deterministic semantic structur...
130
Voted
TPHOL
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-reduction and rewrit...
162
Voted
TPHOL
2008
IEEE
15 years 11 months ago
2008
IEEE
The HOL4 proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an o...
150
click to vote
TPHOL
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
131
click to vote
TPHOL
2007
IEEE
15 years 11 months ago
2007
IEEE
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...