Results 11 to 20 of about 2,986,842 (293)

Decidability of Strong Equivalence for Subschemas of a Class of Linear, Free, near-Liberal Program Schemas [PDF]

In this paper we introduce near-liberal schemas, in which this non-repeating condition applies only to terms not having the form g() for a constant function symbol g.
Danicic, Sebastian, Laurence, Michael, Hierons, Robert   +2 more
core   +9 more sources

Equivalence classes of colorings [PDF]

Banach Center Publications, 2014
For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtained from the former coloring by a ...
Ge, Jun, Jablan, Slavik, Kauffman, Louis H., Lopes, Pedro   +3 more
openaire   +2 more sources

On the Succinct Representation of Equivalence Classes [PDF]

Algorithmica, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman 0001, Timothy M. Chan   +4 more
openaire   +1 more source

Strong Equivalence of Qualitative Optimization Problems [PDF]

, 2013
We introduce the framework of qualitative optimization problems (or, simply, optimization problems) to represent preference theories. The formalism uses separate modules to describe the space of outcomes to be compared (the generator) and the preferences
Truszczyński, Miroslaw, Woltran, Stefan, Faber, Wolfgang   +2 more
core   +3 more sources

Equivalence of switching linear systems by bisimulation [PDF]

, 2006
A general notion of hybrid bisimulation is proposed for the class of switching linear systems. Connections between the notions of bisimulation-based equivalence, state-space equivalence, algebraic and input–output equivalence are investigated.
Schaft, A.J. van der,, Benedetto, M.D. Di,, Benedetto, M.D. Di, M. D. Di Benedetto, Schaft, A.J. van der; id_orcid, Pola, G., van der Schaft, A.J., Pola, G.,, Schaft, A.J. van der, A. J. Van Der Schaft, Di Benedetto, M.D., G. Pola   +11 more
core   +2 more sources

Independence equivalence classes of cycles [PDF]

Discrete Mathematics, 2021
The independence equivalence class of a graph $G$ is the set of graphs that have the same independence polynomial as $G$. Beaton, Brown and Cameron (arXiv:1810.05317) found the independence equivalence classes of even cycles, and raised the problem of finding the independence equivalence class of odd cycles.
openaire   +4 more sources

Stimulus Equivalence: A Laboratory Artefact or the Heart of Language? [PDF]

This thesis surveys some of the implications of the presented collection of publications, all of which address the phenomenon of stimulus equivalence.
Dickins, David
core   +3 more sources

Defining functions on equivalence classes [PDF]

ACM Transactions on Computational Logic, 2006
A quotient construction defines an abstract type from a concrete type, using an equivalence relation to identify elements of the concrete type that are to be regarded as indistinguishable. The elements of a quotient type are equivalence classes : sets of equivalent concrete values.
openaire   +2 more sources

A method for counting the number of polynomial equivalence classes

Journal of Mathematical Cryptology, 2013
As one of the most fundamental problems in multivariate public key cryptosystems (MPKC), Isomorphism of Polynomial (IP) induces an equivalence relation on the polynomials systems.
Wang Tianze, Lin Dongdai
doaj   +1 more source

MORE ON TOTAL DOMINATION POLYNOMIAL AND Dt-EQUIVALENCE CLASSES OF SOME GRAPHS [PDF]

Journal of Algebraic Systems
Let $G = (V, E)$ be a simple graph of order $n$. A total dominating set of $G$ is a subset $D$ of $V$ such that every vertex of $V$ is adjacent to some vertices of $D$.
Saeid Alikhani, Nasrin Jafari
doaj   +1 more source