ion-Driven SAT-based Analysis of Security Protocols . . . . . . . . . . 257 Alessandro Armando, Luca Compagna A Case for Efficient Solution Enumeration . . . . . . . . . . . . . . . . . . . . . . . . . . . 272 Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287 Lintao Zhang, Sharad Malik Local Consistencies in SAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Christian Bessière, Emmanuel Hebrard, Toby Walsh Guiding SAT Diagnosis with Tree Decompositions . . . . . . . . . . . . . . . . . . . . 315 Per Bjesse, James Kukula, Robert Damiano, Ted Stanion, Yunshan Zhu On Computing k-CNF Formula Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . 330 Ryan Williams Effective Preprocessing with Hyper-Resolution and Equality Reduction . . 341 Fahiem Bacchus, Jonathan Winter Read-Once Unit Resolution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 356 Hans Kleine Büning, Xishun Zhao The Interaction Between Inference and Branching Heuristics . . . . . . . . . . . . 370 Lyndon Drake, Alan Frisch Hypergraph Reductions and Satisfiability Problems . . . . . . . . . . . . . . . . . . . 383 Daniele Pretolani Table of

Theory and Applications of Satisfiability Testing

Modular robotic systems

Algorithms on sequences of symbols have been studied for a long time and now form a fundamental part of computer science. One of the very important problems in analysis of sequences is the longest common subsequence problem. For the general case of an arbitrary number of input sequences, the problem is NP-hard. We describe an approach to solve this problem. This approach is based on constructing a logical model for the longest common subsequence problem.

/pdf/the-longest-common-subsequence-problem-9q8wajenuk.pdf

The Longest Common Subsequence Problem

This article presents a comprehensive survey of reconfigurable modular robots, which covers the origin, history, the state of the art, key technologies, challenges, and applications of reconfigurab...

/pdf/survey-on-research-and-development-of-reconfigurable-modular-lmka3sjas8.pdf

Survey on research and development of reconfigurable modular robots

In this paper we present the R package PerMallows, which is a complete toolbox to work with permutations, distances and some of the most popular probability models for permutations: Mallows and the Generalized Mallows models. The Mallows model is an exponential location model, considered as analogous to the Gaussian distribution. It is based on the definition of a distance between permutations. The Generalized Mallows model is its best-known extension. The package includes functions for making inference, sampling and learning such distributions. The distances considered in PerMallows are Kendall's τ , Cayley, Hamming and Ulam.

PerMallows: An R Package for Mallows and Generalized Mallows Models

Composed of multiple modular robotic units, self-reconfigurable modular robots are metamorphic systems that can autonomously rearrange the modules and form different configurations depending on dynamic environments and tasks. The goal of self-reconfiguration is to determine how to change connectivity of modules to transform the robot from the current configuration to the goal configuration subject to restrictions of physical implementation. The existing reconfiguration algorithms use different methods, such as divide-and-conquer, graph matching, and the like, to reduce the reconfiguration cost. However, an optimal solution with a minimal number of reconfiguration steps has not been found yet. The optimal reconfiguration planning problem consists in finding the least number of reconfiguration steps transforming the robot from one configuration to another. This is an NP-complete problem. In this paper, we describe an approach to solve this problem. The approach is based on constructing logical models of the problem under study.

Programming for modular reconfigurable robots

Multiple genome rearrangement by swaps and by element duplications

The set of parameterized k-covers problem

No algorithm determines from an arbitrary recursive system of semigroup identities whether the variety defined by this system is finitely based.

On the Finite Base Property for Semigroup Varieties

An example of a ring variety without an independent basis is constructed. It is proved that this variety is the intersection of two independently based varieties.

V. Yu. Popov

Papers

Programming for modular reconfigurable robots

Multiple genome rearrangement by swaps and by element duplications

The set of parameterized k-covers problem

On the Finite Base Property for Semigroup Varieties

A Ring Variety without an Independent Basis