Search NASA⌕ Search

SEARCH · Search NASA

Results for “satisfiability problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Model checking for linear temporal logic: An efficient implementation

This report provides evidence to support the claim that model checking for linear temporal logic (LTL) is practically efficient. Two implementations of a linear temporal logic model checker is described. One is based on transforming the model checking problem into a satisfiability problem; the other checks an LTL formula for a finite model by computing the cross-product of the finite state transition graph of the program with a structure containing all possible models for the property. An experiment was done with a set of mutual exclusion algorithms and tested safety and liveness under fairness for these algorithms.

Sherman, Rivi↗
NASA NTRS2003

Quantum Adiabatic Algorithms and Large Spin Tunnelling

We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in this paper. The algorithm is applied to a random binary optimization problem (a version of the 3-Satisfiability problem) where the n-bit cost function is symmetric with respect to the permutation of individual bits. The evolution paths are produced, using the generic control Hamiltonians H (r) that preserve the bit symmetry of the underlying optimization problem. In the case where the ground state of H(0) coincides with the totally-symmetric state of an n-qubit system the algorithm dynamics is completely described in terms of the motion of a spin-n/2. We show that different control Hamiltonians can be parameterized by a set of independent parameters that are expansion coefficients of H (r) in a certain universal set of operators. Only one of these operators can be responsible for avoiding the tunnelling in the spin-n/2 system during the quantum adiabatic algorithm. We show that it is possible to select a coefficient for this operator that guarantees a polynomial complexity of the algorithm for all problem instances. We show that a successful evolution path of the algorithm always corresponds to the trajectory of a classical spin-n/2 and provide a complete characterization of such paths.

Boulatov, A.↗
NASA NTRS1984

Static shape determination and control for large space structures. I - The flexible beam. II - A large space antenna

A method for determining and controlling the shape of large, continuous space structures by means of discrete or pointwise observations and control devices is presented. The general linear boundary value problem satisfied by a one-dimensional shape function is defined, and the existence of solutions is studied. The static shape control problems for one-dimensional systems with and without rigid body modes and the static shape estimation problem are presented and solved. Eigenfunction expansions are presented which provide approximations to the algorithm terms when the associated Green's function is not known. An integral operator approach is applied to the multidimensional static problem, and the results are illustrated with a finite element model of the disk of a large space antenna which assumes no rigid body modes. It is shown that the shape control algorithm must be modified for systems with rigid body modes.

Weeks, C. J.↗
NASA NTRS1996

Satisfiability Test with Synchronous Simulated Annealing on the Fujitsu AP1000 Massively-Parallel Multiprocessor

Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables. This report presents a parallel synchronous simulated annealing method for solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor. In particular, we use a parallel synchronous simulated annealing procedure, called Generalized Speculative Computation, which guarantees the same decision sequence as sequential simulated annealing. To demonstrate the performance of the parallel method, we have selected problem instances varying in size from 100-variables/425-clauses to 5000-variables/21,250-clauses. Experimental results on the AP1000 multiprocessor indicate that our approach can satisfy 99.9 percent of the clauses while giving almost a 70-fold speedup on 500 processors.

Sohn, Andrew↗
NASA NTRS1997

When Gravity Fails: Local Search Topology

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\em plateau moves), dominate the time spent in local search. We analyze and characterize {\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Frank, Jeremy↗
NASA NTRS1984

Stability of the laminar boundary layer in a streamwise corner

The stability of viscous, incompressible flow along a streamwise corner, often called the corner boundary layer problem is examined. The semi-infinite boundary value problem satisfied by small amplitude disturbances in the "bending boundary layer' region is obtained. The mean secondary flow induced by the corner exhibits a flow reversal in this region. Uniformly valid "first approximations' to solutions of the governing differential equations are derived. Uniformity at infinity is achieved by a suitable choice of the large parameter and use of an approximate Langer variable. Approximations to solutions of balanced type have a phase shift across the critical layer which is associated with instabilities in the case of two dimensional boundary layer profiles.

Lakin, W. D.↗
NASA NTRS1984

A Simple Algorithm for the Metric Traveling Salesman Problem

An algorithm was designed for a wire list net sort problem. A branch and bound algorithm for the metric traveling salesman problem is presented for this. The algorithm is a best bound first recursive descent where the bound is based on the triangle inequality. The bounded subsets are defined by the relative order of the first K of the N cities (i.e., a K city subtour). When K equals N, the bound is the length of the tour. The algorithm is implemented as a one page subroutine written in the C programming language for the VAX 11/750. Average execution times for randomly selected planar points using the Euclidean metric are 0.01, 0.05, 0.42, and 3.13 seconds for ten, fifteen, twenty, and twenty-five cities, respectively. Maximum execution times for a hundred cases are less than eleven times the averages. The speed of the algorithms is due to an initial ordering algorithm that is a N squared operation. The algorithm also solves the related problem where the tour does not return to the starting city and the starting and/or ending cities may be specified. It is possible to extend the algorithm to solve a nonsymmetric problem satisfying the triangle inequality.

Grimm, M. J.↗
NASA NTRS1984

Stability of the laminar boundary layer in a streamwise corner

The stability of viscous, incompressible flow along a streamwise corner, often called the corner boundary layer problem is examined. The semi-infinite boundary value problem satisfied by small amplitude disturbances in the 'bending boundary layer' region is obtained. The mean secondary flow induced by the corner exhibits a flow reversal in this region. Uniformly valid 'first approximations' to solutions of the governing differential equations are derived. Uniformity at infinity is achieved by a suitable choice of the large parameter and use of an approximate Langer variable. Approximations to solutions of balanced type have a phase shift across the critical layer which is associated with instabilities in the case of two dimensional boundary layer profiles. Previously announced in STAR as N84-17532

Lakin, W. D.↗
NASA NTRS2003

Quantum Adiabatic Optimization and Combinatorial Landscapes

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Smelyanskiy, V. N.↗
NASA NTRS2005

Biased Randomized Algorithm for Fast Model-Based Diagnosis

A biased randomized algorithm has been developed to enable the rapid computational solution of a propositional- satisfiability (SAT) problem equivalent to a diagnosis problem. The closest competing methods of automated diagnosis are described in the preceding article "Fast Algorithms for Model-Based Diagnosis" and "Two Methods of Efficient Solution of the Hitting-Set Problem" (NPO-30584), which appears elsewhere in this issue. It is necessary to recapitulate some of the information from the cited articles as a prerequisite to a description of the present method. As used here, "diagnosis" signifies, more precisely, a type of model-based diagnosis in which one explores any logical inconsistencies between the observed and expected behaviors of an engineering system. The function of each component and the interconnections among all the components of the engineering system are represented as a logical system. Hence, the expected behavior of the engineering system is represented as a set of logical consequences. Faulty components lead to inconsistency between the observed and expected behaviors of the system, represented by logical inconsistencies. Diagnosis - the task of finding the faulty components - reduces to finding the components, the abnormalities of which could explain all the logical inconsistencies. One seeks a minimal set of faulty components (denoted a minimal diagnosis), because the trivial solution, in which all components are deemed to be faulty, always explains all inconsistencies. In the methods of the cited articles, the minimal-diagnosis problem is treated as equivalent to a minimal-hitting-set problem, which is translated from a combinatorial to a computational problem by mapping it onto the Boolean-satisfiability and integer-programming problems. The integer-programming approach taken in one of the prior methods is complete (in the sense that it is guaranteed to find a solution if one exists) and slow and yields a lower bound on the size of the minimal diagnosis. In contrast, the present approach is incomplete and fast and yields an upper bound on the size of the minimal diagnosis.

Williams, Colin↗
NASA NTRS1992

Knowledge-based design of generate-and-patch problem solvers that solve global resource assignment problems

We present MENDER, a knowledge based system that implements software design techniques that are specialized to automatically compile generate-and-patch problem solvers that satisfy global resource assignments problems. We provide empirical evidence of the superior performance of generate-and-patch over generate-and-test: even with constrained generation, for a global constraint in the domain of '2D-floorplanning'. For a second constraint in '2D-floorplanning' we show that even when it is possible to incorporate the constraint into a constrained generator, a generate-and-patch problem solver may satisfy the constraint more rapidly. We also briefly summarize how an extended version of our system applies to a constraint in the domain of 'multiprocessor scheduling'.

Voigt, Kerstin↗
NASA NTRS1971

Design of optimal probing signals for vector parameter estimation.

In the design of optimal inputs or probing signals for parameter estimation, it is more natural to consider functions of the Fisher information matrix as the criterion of optimality instead of some function of the error covariance matrix. The input which maximizes the Fisher information measure for efficient estimation of a scalar parameter also provides the minimum error variance. The information is thus a logical choice for the optimality criterion in scalar problems. No such obvious choice is apparent for vector parameter estimation. A number of performance measures are examined and compared in the present study, and a useful criterion is selected. The design of an optimal probing signal using this criterion is shown to be equivalent to an optimal control problem in which certain equality constraints must be satisfied. This problem may be solved by conventional techniques of deterministic or stochastic optimal control.

Nahi, N. E.↗
NASA NTRS1986

Intractable computations without local minima

An NP-complete problem which is not a spin-glass is exhibited. The NP-complete problem 3-satisfiability is also embedded into a continuous analog system with no hills in the energy landscape obstructing solution of the problem. There is, however, a large flat plateau. This shows how sculpting of the energy surfaces of continuous analog systems to remove hills may fail to aid solution of embedded combinatorial optimization problems.

Baum, Eric B.↗
NASA NTRS1974

Estimation strategies for orbit determination of applications satellites

A procedure for applying covariance analysis to determine the most efficient estimation strategy for satisfying the stringent mission requirements of long arc orbit determination of applications satellites is presented. The procedure is applied to the problem of satisfying mission requirements with respect to altitude determination of GEOS-C. It is shown that requirements are met when twelve dominant geopotential coefficients are estimated along with satellite state. This application of covariance analysis is general and can be applied to future applications satellites. Recommendations for future studies are also given.

Argentiero, P.↗
NASA NTRS2021

Romie: A Domain-Independent Tool for Computer-Aided Robust Operations Management

Romie is a decision support tool based on AI's latest advances in the domain of robust scheduling. Unlike all its predecessors, the tool allows to (i) visually model the operational problem and context entirely (ii) optimize to find near-optimal schedules while taking uncertainty into account and deals with (iii) a combination of various {key performance indicators (KPIs). It comes with a web user interface. Part or all of the modelled activities may be associated to random variables describing their stochastic durations, in order to produce schedules that are robust w.r.t. temporal uncertainty. Hence, depending on the pursued KPIs, the schedules maximize a combination of the following terms: the probability of satisfying the problem constraints, the expected return/efficiency, the expected outcome quality, and even the operators' wellness by minimizing its expected extra-hours. Initially developed for spatial exploration and demonstration in the context of Mars analog missions, this versatile tool is here applied to operations management in both biotechnology manufacturing and robots parametrization in a cave exploration context.

Chien, Steve A.↗
NASA NTRS1973

Quarantine constraints as applied to satellites

Plans for unmanned missions to planets beyond Mars in the 1970s include satellite encounters. Recently published observations of data for Titan, a satellite of Saturn, indicate that conditions may be hospitable for the growth of microorganisms. Therefore, the problem of satisfying possible quarantine constraints for outer planet satellites was investigated. This involved determining the probability of impacting a satellite of Jupiter or Saturn by a spacecraft for a planned satellite encounter during an outer planet mission. Mathematical procedures were formulated which determine the areas in the aim-plane that would result in trajectories that impact the satellite and provide a technique for numerically integrating the navigation error function over the impact area to obtain impact probabilities. The results indicate which of the planned spacecraft trajectory correction maneuvers are most critical in terms of satellite quarantine violation.

Hoffman, A. R.↗
NASA NTRS1973

Quarantine constraints as applied to satellites.

Plans for unmanned missions to planets beyond Mars in the 1970s include satellite encounters. Recently published observations of data for Titan, a satellite of Saturn, indicate that conditions may be hospitable for the growth of microorganisms. Therefore, the problem of satisfying possible quarantine constraints for outer planet satellites was investigated. This involved determining the probability of impacting a satellite of Jupiter or Saturn by a spacecraft for a planned satellite encounter during an outer planet mission. Mathematical procedures were formulated which (1) determine the areas in the aim-plane that would result in trajectories that impact the satellite and (2) provide a technique for numerically integrating the navigation error function over the impact area to obtain impact probabilities. The results indicate which of the planned spacecraft trajectory correction maneuvers are most critical in terms of satellite quarantine violation.

Hoffman, A. R.↗