3658 search results - page 546 / 732 » The logic of proofs, semantically |
165
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
172
click to vote
EKAW
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-ba...
168
click to vote
SAS
1993
Springer
15 years 10 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
153
click to vote
HASE
2007
IEEE
15 years 10 months ago
2007
IEEE
Automated verification plays an important role for high assurance software. This typically uses a pair of pre/post conditions as a formal (but possibly partial) specification of e...
172
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...