'99, volume 1740 of Lecture Notes in Computer Science, pages 167{ 182. Springer-Verlag, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....distance measure, time series 1 Introduction The concept of principal angles between subspaces of linear vector spaces is due to Jordan [9] in the previous century. This notion was translated into the statistical notion of canonical correlations by Hotelling [8] Applications include data analysis [5], random processes [4] 10] and stochastic realization [1] 3] 13] and references herein) Numerically stable methods to compute the canonical structure via a singular value decomposition have been proposed byBj ork and Golub [2] Golub and Zha [7] and can also be found in [6] In this paper we ....

R. Gittins. ######### ######### # ###### #### ############ ## #######,volume 12 of ############ ###. Springer-Verlag, Berlin, 1985.

....in a computation sequence, how to achieve incrementality in the computation process and how to profit from finitely failed derivations as a heuristic for optimizing the algorithms. In the last few years several approaches to the integration of logic and equational programming have been developed [6, 15, 19, 24, 26, 31, 35, 11, 50, 51]. One relevant approach [31, 39] defines equational logic programs as logic programs which are augmented by Horn equational theories. These programs admit least model and fixpoint semantics. Interpreted function symbols can appear as arguments of relations and existentially quantified variables ....

....computation process and how to profit from finitely failed derivations as a heuristic for optimizing the algorithms. In the last few years several approaches to the integration of logic and equational programming have been developed [6, 15, 19, 24, 26, 31, 35, 11, 50, 51] One relevant approach [31, 39] defines equational logic programs as logic programs which are augmented by Horn equational theories. These programs admit least model and fixpoint semantics. Interpreted function symbols can appear as arguments of relations and existentially quantified variables can occur as arguments of ....

[Article contains additional citation context not shown here]

S. Holldobler. , volume 353 of . Springer-Verlag, Berlin, 1989.

....who have too low an expectation and thus feed at poor quality patches, can be shown to be acting in a sub optimal manner. 1 Introduction Ants exhibit fascinating and complex social behaviour. They are able to co operate and work together, and in essence act as if each were a super organism [11]. They forage for food individually and can only make locally based decisions yet are able to exploit even unpredictable environments efficiently and adapt as the environment changes. This is achieved through interaction between individuals by way of communication (direct and indirect) and between ....

Holldobler, B. & Wilson, E.O. (1990) The Ants. Springer-Verlag, Berlin.

....bottom up abstract semantics adequate for modular data flow analysis. A compositional analysis for equational unsatisfiability illustrates our approach. Conditional Term Rewriting Systems (CTRSs for short) are a natural computational paradigm for the integration of logic and equational programming [13,14,16,26]. In this context, programs are sets of conditional equations where the equation in the conclusion is implicitly oriented from left to right, and (some variant of) narrowing is used to solve equational goals, thus supporting logical variables and unification. For the completeness of ....

.... [24] The standard semantics of a program , i.e. the quotient of the Herbrand Universe (or word algebra) by the congruence relation generated by , is known to be isomorphic to the least Herbrand model of the program, i.e. the set of all (ground) equations which hold in the underlying theory [16]. This semantics admits an equivalent fixpoint characterization and, for programs that can be oriented as a confluent term rewriting system , it can be further characterized as the set of all pairs of (ground) terms which can be reduced to a common normal form [10,16,18] E m n n n m ca ....

[Article contains additional citation context not shown here]

S. Holldobler. , volume 353 of . Springer-Verlag, Berlin, 1989.

.... Narrowing Approximations as an Optimization for Equational Logic Programs abstract narrower Conselleria de Cultura, Educaci o i Ci encia de la Generalitat Valenciana Mar ia Alpuente , Moreno Falaschi , Mar ia Jos e Ramis and Germ an Vidal The recent interest in logic programming with equations [12,16,18] has promoted much work on equational unification [14,16,27] and narrowing [16,23] Equational unification ( unification) characterizes the problem of solving equations an equational theory . The narrowing mechanism is a powerful Departamento de Sistemas Inform aticos y Computaci on, Universidad ....

.... Logic Programs abstract narrower Conselleria de Cultura, Educaci o i Ci encia de la Generalitat Valenciana Mar ia Alpuente , Moreno Falaschi , Mar ia Jos e Ramis and Germ an Vidal The recent interest in logic programming with equations [12,16,18] has promoted much work on equational unification [14,16,27] and narrowing [16,23] Equational unification ( unification) characterizes the problem of solving equations an equational theory . The narrowing mechanism is a powerful Departamento de Sistemas Inform aticos y Computaci on, Universidad Polit ecnica de Valencia, Camino de Vera s n, Apdo. 22012, ....

[Article contains additional citation context not shown here]

S. Holldobler. , volume 353 of . Springer-Verlag, Berlin, 1989.

....( and ( i.e. for a suitable function , In the case of logic programs [11] one could be concerned with AND composition (of atoms in a goal or in a clause body) or with OR composition, i.e. composition of (sets of) clauses. In the context of equational logic programming [15,19], consideration has been given to the problem of defining a compositional semantics for the direct union of complete theories which correctly models the computational properties related to the use of logical variables [4] In this paper, we address the problem of solving equations Departamento de ....

....of the union of unification problems. Let a theory be fixed and consider two finite equation sets . We want to define the meaning of (with respect to ) in terms of the meanings of and . Throughout the paper, is assumed to be axiomatized as an equational Horn theory, which is called the program [12,15,19]. We do not consider compositionality with respect to the union of programs in this paper. For this topic we refer to [4] The semantics of equational Horn programs is usually defined as some variant of , a method for generating complete sets of unifiers with respect to a canonical set of clauses. ....

[Article contains additional citation context not shown here]

S. Holldobler. , volume 353 of . Springer-Verlag, Berlin, 1989.

No context found.

'99, volume 1740 of Lecture Notes in Computer Science, pages 167{ 182. Springer-Verlag, 1999.

No context found.

B. Holldobler and E.O. Wilson. The Ants. Springer Verlag, Berlin, Germany, 1990.

No context found.

'99, volume 1740 of Lecture Notes in Computer Science, pages 167{ 182. Springer-Verlag, 1999.

No context found.

Intelligence, volume 446. Springer Verlag, 1990.

No context found.

Intelligence,volume 804. Springer Verlag, Feb 1994.

No context found.

Sciences, volume 9, Springer-Verlag, 1989, pp. 63--111.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC