2076 search results - page 212 / 416 » Functional logic overloading |
103
Voted
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
138
Voted
COLT
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...
136
Voted
ISCAS
1994
IEEE
15 years 7 months ago
1994
IEEE
Abstract: Modified sign Haar transform with sign Walsh-like structure is introduced in this article. This nonlinear transform converts binary/ternary vectors into digital spectral ...
124
Voted
ISMIS
1994
Springer
15 years 7 months ago
1994
Springer
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
118
Voted
CAV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...