Sciweavers

351 search results - page 22 / 71
» Classical Logic with Partial Functions
Sort
View
CCA
2009
Springer
14 years 1 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
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 ...
Vasco Brattka, Guido Gherardi
AGP
1997
IEEE
13 years 11 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
FROCOS
2005
Springer
14 years 27 days ago
Connecting Many-Sorted Structures and Theories Through Adjoint Functions
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...
Franz Baader, Silvio Ghilardi
FM
2003
Springer
98views Formal Methods» more  FM 2003»
14 years 17 days ago
Generating Counterexamples for Multi-valued Model-Checking
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...
Arie Gurfinkel, Marsha Chechik
ICCAD
2010
IEEE
156views Hardware» more  ICCAD 2010»
13 years 5 months ago
Boolean matching of function vectors with strengthened learning
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...
Chih-Fan Lai, Jie-Hong R. Jiang, Kuo-Hua Wang