Results 1  10
of
190
The Detection and Exploitation of Symmetry in Planning Problems
 In IJCAI
, 1999
"... Many planning problems exhibit a high degree of symmetry that cannot yet be exploited successfully by modern planning technology. For example, problems in the Gripper domain, in which a robot with two grippers must transfer balls from one room to another, are trivial to the human problemsolver ..."
Abstract

Cited by 60 (8 self)
 Add to MetaCart
Many planning problems exhibit a high degree of symmetry that cannot yet be exploited successfully by modern planning technology. For example, problems in the Gripper domain, in which a robot with two grippers must transfer balls from one room to another, are trivial to the human problem
Better Verification Through Symmetry
, 1996
"... A fundamental difficulty in automatic formal verification of finitestate systems is the state explosion problem  even relatively simple systems can produce very large state spaces, causing great difficulties for methods that rely on explicit state enumeration. We address the problem by exploiting ..."
Abstract

Cited by 223 (8 self)
 Add to MetaCart
by exploiting structural symmetries in the description of the system to be verified. We make symmetries easy to detect by introducing a new data type scalarset, a finite and unordered set, to our description language. The operations on scalarsets are restricted so that states are guaranteed to have the same
The Identification and Exploitation of Almost Symmetries in Planning Problems
"... Previous work in symmetry detection for planning has identified symmetries between domain objects and shown how the exploitation of this information can help reduce search at plan time. However these methods are unable to detect symmetries between objects that are almost symmetrical: where the objec ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Previous work in symmetry detection for planning has identified symmetries between domain objects and shown how the exploitation of this information can help reduce search at plan time. However these methods are unable to detect symmetries between objects that are almost symmetrical: where
Exploiting symmetry in SMT problems
"... Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance the performance of SMTsolvers by detecting symmetries in the input formulas and use them to prune the search space of the SMT al ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance the performance of SMTsolvers by detecting symmetries in the input formulas and use them to prune the search space of the SMT
Exploiting Structure in Symmetry Detection for CNF
"... Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some humandesigned artifact, and thus are likely to possess much inherent symmetry and sparsity. Previous work[4] has shown that exploiting sy ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some humandesigned artifact, and thus are likely to possess much inherent symmetry and sparsity. Previous work[4] has shown that exploiting
The Detection and Exploitat ion of Symmetry in Planning Problems
"... Many planning problems exhibit a high degree of symmetry that cannot yet be exploited successfully by modern planning technology. For example, problems in the Gripper domain, in which a robot wi th two grippers must transfer balls from one room to another, are tr ivial to the human problemsolver ..."
Abstract
 Add to MetaCart
Many planning problems exhibit a high degree of symmetry that cannot yet be exploited successfully by modern planning technology. For example, problems in the Gripper domain, in which a robot wi th two grippers must transfer balls from one room to another, are tr ivial to the human problem
Dynamically Detecting and Exploiting Symmetry in Finite Constraint Satisfaction Problems
, 2002
"... In this thesis we investigate the dynamic detection of symmetry relations in combinatorial problems modeled as constraint satisfaction problems (CSPs). We examine how to exploit these symmetries in order to generate a compact representation of the solution space and overcome the complexity barrie ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this thesis we investigate the dynamic detection of symmetry relations in combinatorial problems modeled as constraint satisfaction problems (CSPs). We examine how to exploit these symmetries in order to generate a compact representation of the solution space and overcome the com
Exploiting Symmetry in Multiple Knapsack Problems
, 2007
"... The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bincompletion, a binoriented, branchandbound algorithm. We investigate mechanisms for detecting and breaking symmetry in the bincompletion search space. We pro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bincompletion, a binoriented, branchandbound algorithm. We investigate mechanisms for detecting and breaking symmetry in the bincompletion search space. We
Exploiting Structure in Symmetry Detection for CNF
 In Proceedings of the 41st Design Automation Conference
, 2004
"... Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some humandesigned artifact, and thus are likely to possess much inherent symmetry and sparsity. Previous work [4] has shown that exploiting s ..."
Abstract
 Add to MetaCart
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some humandesigned artifact, and thus are likely to possess much inherent symmetry and sparsity. Previous work [4] has shown that exploiting
Detecting and Exploiting Data Type Symmetries of Algebraic . . .
, 1999
"... The symmetry reduction method is a technique designed to alleviate the combinatorial state space explosion problem by exploiting the symmetries of state spaces. This work describes a way how state space symmetries of a highlevel Petri net formalism, algebraic system nets, can be detected and exploi ..."
Abstract
 Add to MetaCart
The symmetry reduction method is a technique designed to alleviate the combinatorial state space explosion problem by exploiting the symmetries of state spaces. This work describes a way how state space symmetries of a highlevel Petri net formalism, algebraic system nets, can be detected
Results 1  10
of
190