A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neural-like implementation of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approa...

[1] As the incidence of groundwater contamination continues to grow, a number of inverse modeling methods have been developed to address forensic groundwater problems. In this work the geostatistical approach to inverse modeling is extended to allow for the recovery of the antecedent distribution of a contaminant at a given point back in time, which is critical to the assessment of historical e...

Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of a goal w.r.t. a given program is done in two separate phases. During the operational one, admissible steps are systematically applied in a similar way to classical resolution steps in pure logic programming, thus returning a c...

‎this paper considers a non-local initial-boundary value problem containing a first order partial differential equation with variable coefficients‎. ‎at first‎, ‎the non-self-adjoint spectral problem is derived‎. ‎then its adjoint problem is calculated‎. ‎after that‎, ‎for the adjoint problem the associated eigenvalues and the subsequent eigenfunctions are determined‎. ‎finally the convergence ...

Let $A=U|A|$ be the polar decomposition of an operator $A$ on a Hilbert space $mathscr{H}$ and $lambdain(0,1)$. The $lambda$-Aluthge transform of $A$ is defined by $tilde{A}_lambda:=|A|^lambda U|A|^{1-lambda}$. In this paper we show that emph{i}) when $mathscr{N}(|A|)=0$, $A$ is self-adjoint if and only if so is $tilde{A}_lambda$ for some $lambdaneq{1over2}$. Also $A$ is self adjoint if and onl...