We introduce methods for identifying operator preconditions that need not be expanded further. The methods are proved to be admissible , that is, they will not cause a solution to be missed when one exists. In certain cases, the methods also identify operator reformulations that increase the number of nonexpandable preconditions. This approach provides effective loop control in common situation...

In this paper, we propose near admissible multiobjective search algorithms to approximate, with performance guarantee, the set of Pareto optimal solution paths in a state space graph. Approximation of Pareto optimality relies on the use of an epsilon-dominance relation between vectors, significantly narrowing the set of nondominated solutions. We establish correctness of the proposed algorithms...

We introduce the two substructural propositional logics KL, KL, which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a variant thereof. We also prove strong completeness for language models, where each logic comes with a different interpretation. We show that for both logics the...

The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular constraints on admissible solutions. It is known that this problem is decidable, albeit with very high complexity. We consider and solve variant problems where the set of solutions is compared to regular constraint sets and where on...

In this paper a sufficient condition on the minimum dwell time that guarantees the stability of switched linear systems is given. The proposed method interprets the stability of switched linear systems through the distance between the eigenvector sets of subsystem matrices. Thus, an explicit relation in view of stability is obtained between the family of the involved subsytems and the set of ad...

We consider Hardy’s integral inequality and we obtain some new generalizations of Bicheng-Debnath’s recent results. We derive two distinguished classes of inequalities covering all admissible choices of parameter k from Hardy’s original relation. Moreover, we prove the constant factors involved in the right-hand sides of some particular inequalities from both classes to be the best possible, th...

We consider both local and global theta correspondences for GSp4 and GSO4,2. Because of the accidental isomorphism PGSO4,2 PGU2,2, these correspondences give rise to those between GSp4 and GU2,2 for representations with trivial central characters. In the global case, using this relation, we characterize representations with trivial central character, which have Shalika period on GU(2, 2) by the...

The Maximum Entropy Principle (MEP) maximises the entropy provided that the effort remains constant. The Principle of Least Effort (PLE) minimises the effort provided that the entropy remains constant. The paper investigates the relation between these two principles. In some kinds of effort functions, called admissible, it is shown that these two principles are equivalent. The results are illus...

Partial determinations are an interesting form of dependency between attributes in a relation. They generalize functional dependencies by allowing exceptions. We modify a known MDL formula for evaluating such partial determinations to allow for its use in an admissible heuristic in exhaustive search. Furthermore we describe an eecient preprocessing-based approach for handling numerical attribut...

The idea of symmetry is a built-in feature the metric function. In this paper, we investigate existence and uniqueness fixed point certain contraction via orthogonal triangular ?-orbital admissible mapping in context complete Branciari spaces endowed with transitive binary relation. Our results generalize extend some pioneering literature. Furthermore, criteria solutions to fractional integro-d...