Unification is a central operation in the construction of a range of computational logic systems based on first-order and higher-order logics. First-order unification has a number of properties that dominates the way it is incorporated within such systems. In particular, first-order unification is decidable, unary, and can be performed on untyped term structures. None of these three properties ...

Evolutionary algorithms are only superficially different and can be unified within an axiomatic geometric framework by abstraction of the solution representation. This framework describes the evolutionary search in a representation-independent way, purely in geometric terms, paving the road to a general theory of evolutionary algorithms. It also leads to a principled design methodology for the ...

Abstract Unification is a central operation in constructing range of computational logic systems based on first-order and higher-order logics. First-order unification has several properties that guide its incorporation such systems. In particular, decidable, unary, can be performed untyped term structures. None these three hold for full unification: undecidable, unifiers incomparable, term-leve...

Grand gauge-Higgs unification of five dimensional SU(6) gauge theory on an orbifold $S^1/Z_2$ with localized kinetic terms is discussed. The Standard model (SM) fermions the boundaries and some massive bulk coupling to SM boundary are introduced. Taking power-law running contributions from fields into account, perturbative shown be realized at around $10^{14}$ GeV, which a few order smaller tha...

one of the most important problems in geodesy is the unification of height datum. generally in geodesy; there are two types of height systems, the geometrical height based on ellipsoid and the physical height based on gravity-defined surface (zhang et al, 2009).local height datum is determined according to mean sea level (msl). in regarding to mismatch of mean sea level and geoid, on the one ha...

For reasoning on the Web, Datalog is lacking data extraction and value invention. This article proposes to overcome these limitations with “simulation unification” and “RDFLog”. Simulation unification is a non-standard unification inspired from regular path queries. Like standard unification, it yields bindings for variables in both terms to unify. Unlike standard unification, it does not try t...

We examine unification of gauge couplings in four dimensional renormalizable gauge theories inspired by the latticized (deconstructed) SM or MSSM in five dimensions. The models are based on replicated gauge groups, spontaneously broken to the diagonal subgroup. The analysis is performed at one-loop level, with the contribution from the heavy vector bosons included, and compared with the analogo...

The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [4] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table.

Unification in DLs has been introduced as a novel inference service that can be used to detect redundancies in ontologies, by finding out whether two concept descriptions may potentially stand for the same concept. Intuitively, one assumes for this that certain concept names occurring in the concept descriptions stand for concepts that are not yet fully defined, and unification checks whether i...