FAQ

Symmetric closure

In mathematics, the symmetric closure of a binary relation R on a set X is the smallest symmetric relation on X that contains R. For example, if X is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2018
012319932018

Related topics

Related topics

5 relations
Abstract rewriting systemReflexive closureRewrite orderRewriting
(More)

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Symmetric closure
Rewriting
Transitive closure
Abstract rewriting system
Rewrite order
Reflexive closure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
On single valued neutrosophic relations
Smarandache initiated neutrosophic sets (NSs) which can be used as a mathematical tool for dealing with indeterminate and… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2016
2016
Complexity and polymorphisms for digraph constraint problems under some basic constructions
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context… (More)
Is this relevant?
2013
2013
Digraph related constructions and the complexity of digraph homomorphism problems
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
Kernels and closures of soft set relations, and soft set relation mappings
In this paper, the notions of anti-reflexive kernel, symmetric kernel, reflexive closure, and symmetric closure of a soft set… (More)
Is this relevant?
2008
2008
Symmetric Structure for Closure Algebras
The aim of this paper is to investigate the variety of symmetric closure algebras, that is, closure algebras endowed with a De… (More)
  • figure 1
Is this relevant?
2006
2006
Acyclic Argumentation: Attack = Conflict + Preference
In this paper we study the fragment of Dung’s argumentation theory in which the strict attack relation is acyclic. We show that… (More)
Is this relevant?
2004
2004
Symmetric Relations and Cardinality-Bounded Multisets in Database Systems
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
1999
1999
XML schemas without order
XML schemas consist of context-free grammars that allow regular expressions on the right-hand side of productions. In the schema… (More)
  • figure 2
Is this relevant?
1996
1996
Feasibility conditions for non-symmetric 3-class association schemes
In this paper a set of necessary conditions for the existence of a non-symmetric 3-class association scheme expressed in terms of… (More)
  • table 1
Is this relevant?
1995
1995
Non deterministic extensions of untyped -calculus
The main concern of this paper is the study of the interplay between functionality and non determinism. Indeed the rst question… (More)
Is this relevant?