Scan Science and Technology
Contact Leading Edge Experts & Companies
Antichain
The Experts below are selected from a list of 3120 Experts worldwide ranked by ideXlab platform
Jeanfrancois Raskin – One of the best experts on this subject based on the ideXlab platform.

Symblicit algorithms for meanpayoff and shortest path in monotonic Markov decision processes
Acta Informatica, 2017CoAuthors: Aaron Bohy, Jeanfrancois Raskin, Véronique Bruyère, Nathalie BertrandAbstract:When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a socalled symblicit algorithm for the synthesis of optimal strategies in MDPs, in the quantitative setting of expected meanpayoff. This algorithm, based on the strategy iteration algorithm of Howard and Veinott, efficiently combines symbolic and explicit data structures, and uses binary decision diagrams as symbolic representation. The aim of this paper is to show that the new data structure of pseudoAntichains (an extension of Antichains) provides another interesting alternative, especially for the class of monotonic MDPs. We design efficient pseudoAntichain based symblicit algorithms (with open source implementations) for two quantitative settings: the expected meanpayoff and the stochastic shortest path. For two practical applications coming from automated planning and $$\mathsf {LTL}$$ LTL synthesis, we report promising experimental results w.r.t. both the run time and the memory consumption. We also show that a variant of pseudoAntichains allows to handle the infinite state spaces underlying the qualitative verification of probabilistic lossy channel systems.

Antichain based qbf solving
Automated Technology for Verification and Analysis, 2011CoAuthors: Thomas Brihaye, Véronique Bruyère, Lauren Doyen, Marc Ducobu, Jeanfrancois RaskinAbstract:We consider the problem of QBF solving viewed as a reachability problem in an exponential AndOr graph. Antichainbased algorithms for reachability analysis in large graphs exploit certain subsumption relations to leverage the inherent structure of the explored graph in order to reduce the effect of state explosion, with high performance in practice.
In this paper, we propose simple notions of subsumption induced by the structural properties of the AndOr graphs for QBF solving. Subsumption is used to reduce the size of the search tree, and to define compact representations of certificates (in the form of Antichains) both for positive and negative instances of QBF. We show that efficient exploration of the reduced search tree essentially relies on solving variants of MaxSAT and MinSAT. Preliminary standalone experiments of this algorithm show that the Antichainbased approach is promising.

ATVA – Antichainbased QBF solving
Automated Technology for Verification and Analysis, 2011CoAuthors: Thomas Brihaye, Véronique Bruyère, Lauren Doyen, Marc Ducobu, Jeanfrancois RaskinAbstract:We consider the problem of QBF solving viewed as a reachability problem in an exponential AndOr graph. Antichainbased algorithms for reachability analysis in large graphs exploit certain subsumption relations to leverage the inherent structure of the explored graph in order to reduce the effect of state explosion, with high performance in practice.
In this paper, we propose simple notions of subsumption induced by the structural properties of the AndOr graphs for QBF solving. Subsumption is used to reduce the size of the search tree, and to define compact representations of certificates (in the form of Antichains) both for positive and negative instances of QBF. We show that efficient exploration of the reduced search tree essentially relies on solving variants of MaxSAT and MinSAT. Preliminary standalone experiments of this algorithm show that the Antichainbased approach is promising.
Dmitri I. Panyushev – One of the best experts on this subject based on the ideXlab platform.

Short Antichains in root systems, semiCatalan arrangements, and B stable subspaces
European Journal of Combinatorics, 2004CoAuthors: Dmitri I. PanyushevAbstract:Let G be a complex simple algebraic group with Lie algebra g. Fix a Borel subalgebra b. An ideal of b is called adnilpotent, if it is contained in [b, b]. The goal of this paper is to present a refinement of the enumerative theory of adnilpotent ideals in the case, where g has roots of different length. Let Ad denote the set of all adnilpotent ideals of b. Any c ∈ Ad is completely determined by the corresponding set of roots. The minimal roots in this set are called the generators of an ideal. The collection of generators of an ideal forms an Antichain in the poset of positive roots, and the whole theory can be expressed in the combinatorial language, in terms of Antichains. An Antichain is called strictly positive, if it contains no simple roots. Enumerative results for all and strictly positive Antichains were recently obtained in the work of Athanasiadis, Cellini–Papi, Sommers, and this author [1–4, 9, 13]. There are two different theoretical approaches to describing (enumerating) Antichains. The first approach consists of constructing a bijection between Antichains and the coroot lattice points lying in a certain simplex. An important intermediate step here is a bijection between Antichains and the socalled minimal elements of the affine Weyl group, Ŵ . It turns out that the simplex obtained is “equivalent” to a dilation of the fundamental alcove of Ŵ , so that the problem of counting the coroot lattice points in it can be resolved. For strictly positive Antichains, one constructs another bijection and another simplex, and the respective elements of Ŵ are called maximal; yet, everything is quite similar. The second approach uses the Shi bijection between the adnilpotent ideals (or Antichains) and the dominant regions of the Catalan arrangement. Under this bijection, the strictly positive Antichains correspond to the bounded regions. There is a powerful result of Zaslavsky allowing one to compute the number of all and bounded regions, if the characteristic polynomial of the arrangement is known. Since the characteristic polynomial of the Catalan arrangement was recently computed in [1], the result follows. If g has roots of different length, one can distinguish the length of elements occurring in Antichains. We say that an Antichain is short, if it consists of only short roots. This notion has a natural representationtheoretic incarnation: the short Antichains are in

Short Antichains in root systems, semiCatalan arrangements, and Bstable subspaces
arXiv: Combinatorics, 2003CoAuthors: Dmitri I. PanyushevAbstract:Let $\be$ be a Borel subalgebra of a complex simple Lie algebra $\g$. An ideal of $\be$ is called adnilpotent, if it is contained in $[\be,\be]$. The generators of an adnilpotent ideal give rise to an Antichain in the poset of positive roots, and the whole theory can be expressed in a combinatorial fashion, in terms of Antichains. The aim of this paper is to present a refinement of the enumerative theory of adnilpotent ideals for the case in which $\g$ has roots of different length. An Antichain is called short, if it consists of short roots. We obtain, for short Antichains, analogues of all results known for the usual Antichains.
Elizabeth Wilcox – One of the best experts on this subject based on the ideXlab platform.

quasi Antichain chermak delgado lattices of finite groups
Archiv der Mathematik, 2014CoAuthors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The Chermak–Delgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasiAntichain interval in the Chermak–Delgado lattice, ultimately proving that if there is a quasiAntichain interval between subgroups L and H with L ≤ H then there exists a prime p such that H/L is an elementary abelian pgroup and the number of atoms in the quasiAntichain is one more than a power of p. In the case where the Chermak–Delgado lattice of the entire group is a quasiAntichain, the relationship between the number of abelian atoms and the prime p is examined; additionally, several examples of groups with a quasiAntichain Chermak–Delgado lattice are constructed.

QuasiAntichain Chermak–Delgado lattices of finite groups
Archiv der Mathematik, 2014CoAuthors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The Chermak–Delgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasiAntichain interval in the Chermak–Delgado lattice, ultimately proving that if there is a quasiAntichain interval between subgroups L and H with L ≤ H then there exists a prime p such that H / L is an elementary abelian p group and the number of atoms in the quasiAntichain is one more than a power of p . In the case where the Chermak–Delgado lattice of the entire group is a quasiAntichain, the relationship between the number of abelian atoms and the prime p is examined; additionally, several examples of groups with a quasiAntichain Chermak–Delgado lattice are constructed.

QuasiAntichain ChermakDelgado Lattices of Finite Groups
arXiv: Group Theory, 2014CoAuthors: Ben Brewster, Peter Hauck, Elizabeth WilcoxAbstract:The ChermakDelgado lattice of a finite group is a dual, modular sublattice of the subgroup lattice of the group. This paper considers groups with a quasiAntichain interval in the ChermakDelgado lattice, ultimately proving that if there is a quasiAntichain interval between $L$ and $H$ with $L \leq H$ then there exists a prime $p$ such that the quotient $H / L$ is an elementary abelian $p$group and the number of atoms in the quasiAntichain is one more than a power of $p$. In the case where the ChermakDelgado lattice of the entire group is a quasiAntichain, the relationship between the number of abelian atoms and the prime $p$ is examined; additionally several examples of group with a quasiAntichain ChermakDelgado lattice are constructed.