نتایج جستجو برای: Algebraic Resolution

تعداد نتایج: 339011  

Journal: :Algebraic & Geometric Topology 2015

In this paper, we develop a numerical resolution of the space-time fractional advection-dispersion equation. We utilize spectral-collocation method combining with a product integration technique in order to discretize the terms involving spatial fractional order derivatives that leads to a simple evaluation of the related terms. By using Bernstein polynomial basis, the problem is transformed in...

Journal: :International Journal of Theoretical Physics 2006

Journal: :algebraic structures and their applications 2014
habib sharif

let $k$ be a field of characteristic$p>0$, $k[[x]]$, the ring of formal power series over $ k$,$k((x))$, the quotient field of $ k[[x]]$, and $ k(x)$ the fieldof rational functions over $k$. we shall give somecharacterizations of an algebraic function $fin k((x))$ over $k$.let $l$ be a field of characteristic zero. the power series $finl[[x]]$ is called differentially algebraic, if it satisfies...

Journal: :J. Electronic Imaging 2013
Karim Zarei Zefreh Wim van Aarle Kees Joost Batenburg Jan Sijbers

A new superresolution algorithm is proposed to reconstruct a high-resolution license plate image from a set of low-resolution camera images. The reconstruction methodology is based on the discrete algebraic reconstruction technique (DART), a recently developed reconstruction method. While DART has already been successfully applied in tomographic imaging, it has not yet been transferred to the f...

Journal: :Fundam. Inform. 1996
Jan A. Plaza

We present an approach to foundations of logic programming in which the connection with algebraic semantics becomes apparent. The approach is based on omega-Herbrand models instead of conventional Herbrand models. We give a proof of Clark's theorem on completeness of SLD-resolution by methods of the algebraic semantics. We prove the existence property for deenite programs.

Journal: :Bulletin of the American Mathematical Society 2010

2007
Zbigniew Stachniak

The search for possible formalizations of logical calculi that are well suited for computer implementations is in the core of the methodological studies in the area of Automated Reasoning (cf. [1], [4], [5]). The theory of resolution proof systems developed in [4] provides a formal framework for the construction and study of the deductive proof systems based on the resolution principle. Resolut...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید