Results 271 to 280 of about 4,279,285 (309)
Some of the next articles are maybe not open access.
Resolution games and non-liftable resolution orderings
1995We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules, as for example saturation. This is possible because of a new proof method which avoids making use of the standard ordered lifting theorem.
openaire +2 more sources
A note on the completeness of resolution without self-resolution
Information Processing Letters, 1989The note shows that self-resolution in resolution-based deduction systems can be omitted. The completeness of resolution is a consequence of the completeness of hyperresolution.
openaire +2 more sources
Rad Jugoslavenske akademije znanosti i umjetnosti. Razred za matematičke, fizičke, kemijske i tehničke znanosti. Matematičke znanosti, 1988
In the present paper we give a partial answer to the question: Let p : X -> X = {;X_a , f_ab , A}; be a resolution with dim X_a < n. Is it true that dim X < n and dam (lim X) < n. The main result of Section One is a characterization of a base of X. An important property of a resolution gives 1.8. Section Two is devoted to the mappings p_a:X-> X_a.
openaire +2 more sources
In the present paper we give a partial answer to the question: Let p : X -> X = {;X_a , f_ab , A}; be a resolution with dim X_a < n. Is it true that dim X < n and dam (lim X) < n. The main result of Section One is a characterization of a base of X. An important property of a resolution gives 1.8. Section Two is devoted to the mappings p_a:X-> X_a.
openaire +2 more sources
Sparse deconvolution improves the resolution of live-cell super-resolution fluorescence microscopy
Nature Biotechnology, 2021Yulin Zhang +2 more
exaly
2000
We propose an algebraic reconstruction of resolution as Knuth-Bendix completion. The basic idea is to model propositional ordered Horn resolution and resolution as rewrite-based solutions to the uniform word problems for semilattices and distributive lattices.
openaire +1 more source
We propose an algebraic reconstruction of resolution as Knuth-Bendix completion. The basic idea is to model propositional ordered Horn resolution and resolution as rewrite-based solutions to the uniform word problems for semilattices and distributive lattices.
openaire +1 more source
Deep Learning for Image Super-Resolution: A Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021Steven Hoi, Zhihao Wang
exaly