446 search results - page 77 / 90 » A Theorem Prover for a Computational Logic |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always ...
JANCL
2008
13 years 7 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
BIRTHDAY
2005
Springer
14 years 28 days ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
FOSSACS
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The enriched effect calculus is an extension of Moggi's computational metalanguage with a selection of primitives from linear logic. In this paper, we present an ext...