نتایج جستجو برای: infinite domains

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

Journal: :CoRR 2015
Guilhem Gamard Gwénaël Richomme

A word is quasiperiodic (or coverable) if it can be covered with occurrences of another finite word, called its quasiperiod. A word is multi-scale quasiperiodic (or multi-scale coverable) if it has infinitely many different quasiperiods. These notions were previously studied in the domains of text algorithms and combinatorics of right infinite words. We extend them to infinite pictures (two-dim...

2003
Stijn Heymans Dirk Vermeir

We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infini...

Journal: :Theor. Comput. Sci. 1993
Reinhold Heckmann

Lower, upper, sandwich, mixed, and convex power domains are isomorphic to domains of second order predicates mapping predicates on the ground domain to logical values in a semiring. The various power domains diier in the nature of the underlying semiring logic and in logical constraints on the second order predicates.

Journal: :AI Commun. 2004
Antonio J. Fernández

The paper abstracts the contents of a PhD dissertation entitled A Generic, Collaborative Framework for Interval Constraint Solving which has been recently defended. This thesis presents a generic framework for defining and solving interval constraints on any set of domains (finite or infinite) that are lattices. This framework combines a number of characteristics desirable in any constraint sys...

Journal: :Advances in Computational Mathematics 2022

The technique of complex scaling for time harmonic wave-type equations relies on a coordinate stretching to generate exponentially decaying solutions. In this work, we use Galerkin method with ansatz functions infinite support discretize complex-scaled scalar Helmholtz-type resonance problems inhomogeneous exterior domains. We show super-algebraic convergence the respect number unknowns in radi...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2011
André Liemert Alwin Kienle

Analytical solutions of the diffusion equation for a radially N-layered cylinder were derived in the steady-state, frequency, and time domains. Solutions for axially infinite and finite cylinders are presented. The derived formulas were compared to a known solution of the diffusion equation for a layered semi-infinite geometry and to Monte Carlo simulations, showing excellent and good agreement...

Journal: :European Journal of Mechanics A-solids 2021

The superposition theory is adopted to study the boundary value problem of needle domains in barium titanate single crystals, which decomposes into an infinite-medium solution and a complementary solution. model equivalent edge dislocation line charge calculate fields due discrete infinite medium. solutions are obtained from linear elastic using finite element method. influence boundaries on ar...

Journal: :international journal of group theory 2012
r sharma pooja yadav kanchan joshi

in this paper we consider the group algebra $r(c_2times‎ ‎d_infty)$‎. ‎it is shown that $r(c_2times d_infty)$ can be‎ ‎represented by a $4times 4$ block circulant matrix‎. ‎it is also‎ ‎shown that $mathcal{u}(mathbb{z}_2(c_2times d_infty))$ is‎ ‎infinitely generated‎.

Journal: :biquarterly journal of control and optimization in applied mathematics 2015
alaeddin malek ghasem ahmadi seyyed mehdi mirhoseini alizamini

‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...

Journal: :TPLP 2010
Gianluca Amato Francesca Scozzari

In the analysis of logic programs, abstract domains for detecting sharing and linearity information are widely used. Devising abstract unification algorithms for such domains has proved to be rather hard. As a consequence, only correct algorithms are available at the moment, which partially exploit the information conveyed by the abstract domains. In this paper, we define a new (infinite) domai...

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

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