351 search results - page 22 / 71 » Classical Logic with Partial Functions |
102
Voted
CCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
114
click to vote
AGP
1997
IEEE
15 years 4 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
107
click to vote
FROCOS
2005
Springer
15 years 6 months ago
2005
Springer
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
109
Voted
FM
2003
Springer
15 years 5 months ago
2003
Springer
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
96
Voted
ICCAD
2010
IEEE
14 years 10 months ago
2010
IEEE
Boolean matching for multiple-output functions determines whether two given (in)completely-specified function vectors can be identical to each other under permutation and/or negat...