This paper exhibits the transformation of Watkins’ Q(λ) learning algorithm into an adversarial Qlearning algorithm. A method called context-based prediction, borrowed from multimedia data coding, is used as opponent modeling and is incorporated in the transformed, CBQ(λ) algorithm. We tested CBQ(λ) by playing against three opponents. The first opponent had no prior knowledge and discovered poli...

apriori algorithm is the most popular algorithm in association rules mining. one of the problems the apriori algorithm is that the user must specify a minimum support threshold. consider that a user wants to implement the apriori algorithm on a database with millions of transactions; users will not have the necessary knowledge about all the transactions in the database and therefore cannot dete...

In this paper, we discuss and mathematically compute the eigenvalues characteristic polynomials of special even square matrices orders 4x4 8x8. Also, introduce two 8th order compound magic squares. The computed values are verified using Maple software. First, for 4th matrix, polynomial was derived to be: λ(λ-2s)( λ²+4Θ) with eigenvalues: 0,2 s, other conjugates. further analysis, performed nume...

Starting with Knutson and Tao’s hive model [KT99], we characterize the Littlewood– Richardson coefficient c λ,μ of given partitions λ, μ, ν ∈ N as the number of capacity achieving hive flows on the honeycomb graph. Based on this, we design a polynomial time algorithm for deciding c λ,μ > 0. This algorithm is easy to state and takes O (

We define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive logic frame is called recursively (countably) compact, if every recursive (respectively, countable) finitely consistent theory has a model. We show that for log...

In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic λ-calculus by introducing a finiteness structure on resource terms, which is such that a λ-term is strongly normalizing iff the supp...

Abstract Decades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms efficiency. Instead a new higher-order prover from the ground up, we propose to start with state-of-the-art superposition E gradually enrich it features. We explain how extend prover’s $$\lambd...

Kurz et al. have recently shown that infinite λ-trees with finitely many free variables modulo α-equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigate the rational fixpoint of that functor. We prove that it is formed by all rational λtrees, i.e. those λ-trees which have only finitely many subtrees (up to isomorphism). This yields a corecursion pri...

Statman's 1-Section Theorem [17] is an important but little-known result in the model theory of the simplytyped λ-calculus. The λ-Section Theorem states a necessary and sufficient condition on models of the simplytyped λ-calculus for determining whether βη-equational reasoning is complete for proving equations that hold in a model. We review the statement of the theorem, give a detailed proof, ...