Search NASA⌕ Search

SEARCH · Search NASA

Results for “Formal Reasoning”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Investigation of automated task learning, decomposition and scheduling

The details and results of research conducted in the application of neural networks to task planning and decomposition are presented. Task planning and decomposition are operations that humans perform in a reasonably efficient manner. Without the use of good heuristics and usually much human interaction, automatic planners and decomposers generally do not perform well due to the intractable nature of the problems under consideration. The human-like performance of neural networks has shown promise for generating acceptable solutions to intractable problems such as planning and decomposition. This was the primary reasoning behind attempting the study. The basis for the work is the use of state machines to model tasks. State machine models provide a useful means for examining the structure of tasks since many formal techniques have been developed for their analysis and synthesis. It is the approach to integrate the strong algebraic foundations of state machines with the heretofore trial-and-error approach to neural network synthesis.

Livingston, David L.↗
NASA NTRS1999

A Spherical Earth Solution for TOA Lightning Location Retrieval

With the advent of high-speed digital computers, the method of chi square minimization is a highly practical means for analyzing a wide variety of (otherwise intractable) nonlinear inversion problems in applied mathematical physics. Little thought or effort is required to apply the chi square method to obtain quick and reasonable estimates of a solution, and the method offers a means to assess retrieval errors. Because the method is simple and practical it is sometimes hastily applied to problems that can be solved by formal analytic or quasi-analytic means. Presently, Global Atmospherics Inc. (GAI) finds the minimum of a chi square function to analyze time-of-arrival (TOA) and magnetic bearing data derived from the National Lightning Detection Network (NLDN); ellipsoidal Earth geometry is assumed. An analytic solution to this problem has not yet been attained, but the consideration and solving of less general problem statements might eventually lead to a final solution. In the present study, the problem of retrieving lightning ground-strike location on a spherical Earth surface using a network of 4 or more time-of-arrival (TOA) sensors is considered. It is shown that this problem has an analytic solution and therefore does not require the use of nonlinear estimation theory (such as the chi square method mentioned above). The mathematical robustness of the analytic solution is tested using computer-generated lightning sources and simulated TOA measurement errors. A quasi-analytic extension of the spherical Earth solution for an oblate spheroidal Earth geometry is considered in a related study. The incorporation of magnetic bearing information into these analytic solutions would lead to a general and elegant analytic retrieval scheme that would most likely replace the chi square estimation theory currently employed by Global Atmospherics Inc. (GAI).

Koshak, William J,↗
NASA NTRS2005

About an Element of Human Greatness

One of the things Dr. von Braun instinctively knew was that it was as nearly important to explain why we should go into space as to build the machines to take us there. He wrote books and magazine articles, spoke to everyone he could formally and informally, and spent his life to his dying day seeking to educate everyone on the importance of and need for spaceflight. Why should we go? I think there are actually two principle reasons: 1) Because the solar system is filled with cheap, clean energy, and we need to go get it, and, 2) this one may well be even more important, because we need a purpose for ourselves and our country. I think we need an eternal frontier to push up against, our purpose to conquer and settle it. The nice thing about doing that is the solar system is a very rich place, filled with not only mineral wealth but energy, a nearly inexhaustible supply. And if there s one thing this country and this planet desperately needs and is willing to pay for now and forever is energy. The solar system is where it is. We've got to go after it. I believe, then, that Americans have both a self-interest and a patriotic duty to convince ourselves it is time to take another giant step into space. The way to do that is to do what Dr. von Braun did, cut metal and start flying. Success engenders success. Dr. von Braun s grand dream need never die. NASA can spark a twenty-first-century revolution in transportation and energy that could fundamentally change the way we fly through space, power the world, even care for the sick if we do it right. All those things require cheap and clean energy. It exists in the solar system in a variety of forms. Solar energy is the most obvious form, but there are others, including helium-3, which may be the perfect fuel for fusion reactors, and also just happens to cover the Moon. I believe we must go after it. We just need to believe in ourselves and our purpose. I call on all of you here today to join together, get things moving again, and get serious about conquering space. If we do, we'll assure the country s prosperity, and the world s survival, too, for centuries. Along the way, maybe we ll finally understand why my old preacher thought St. Peter s comment about looking for new heavens was so important. According to His promise, it s a big challenge, a huge responsibility, to try to fulfill such a promise and prophecy.

Hickam, Homer↗
NASA NTRS1979

An algorithm for retrieval of ocean surface and atmospheric parameters from the observations of the scanning multichannel microwave radiometer (SMMR)

A formalism was developed which can be used to interpret the data in terms of sea surface temperature, sea surface wind speed, and the atmospheric overburden of water vapor and liquid water. It was shown with reasonable instrumental performance assumptions, these parameters could be derived to useful accuracies. Although the algorithms were not derived for use in rain, it is shown that, at least, token rain rates can be tolerated without invalidating the retrieved geophysical parameters.

Wilheit, T. T.↗
NASA NTRS1980

An algorithm for retrieval of ocean surface and atmospheric parameters from the observations of the scanning multichannel microwave radiometer

The scanning multichannel microwave radiometer is a five-frequency (6.6, 10.7, 18, 21, and 37 GHz), dual-polarized microwave radiometer, which was launched in two separate satellites, Nimbus 7 and Seasat, in 1978. A formalism is developed which can be used to interpret the data in terms of sea surface temperature, sea surface wind speed, and the atmospheric content of water vapor and liquid water. It is shown with reasonable instrumental performance assumptions that these parameters can be derived to useful accuracies. Although the algorithms are not derived for use in rain, it is shown that at least token rain rates can be tolerated without invalidating the retrieved geophysical parameters.

Wilheit, T. T.↗
NASA NTRS1990

What can formal methods offer to digital flight control systems design

Formal methods research begins to produce methods which will enable mathematic modeling of the physical behavior of digital hardware and software systems. The development of these methods directly supports the NASA mission of increasing the scope and effectiveness of flight system modeling capabilities. The conventional, continuous mathematics that is used extensively in modeling flight systems is not adequate for accurate modeling of digital systems. Therefore, the current practice of digital flight control system design has not had the benefits of extensive mathematical modeling which are common in other parts of flight system engineering. Formal methods research shows that by using discrete mathematics, very accurate modeling of digital systems is possible. These discrete modeling methods will bring the traditional benefits of modeling to digital hardware and hardware design. Sound reasoning about accurate mathematical models of flight control systems can be an important part of reducing risk of unsafe flight control.

Good, Donald I.↗
DOE OSTI2025

ARCS: Agentic Retrieval-Augmented Code Synthesis with Iterative Refinement

Agentic Retrieval-Augmented Code Synthesis with Iterative RefinementIn supercomputing, efficient and optimized code generation is essential to leverage high-performance systems effectively. We have developed Agentic Retrieval-Augmented Code Synthesis (ARCS), an advanced framework for accurate, robust, and efficient code generation, completion, and translation. ARCS integrates Retrieval-Augmented Generation (RAG) with Chain-of-Thought (CoT) reasoning to systematically break down and iteratively refine complex programming tasks. An agent-based RAG mechanism retrieves relevant code snippets, while real-time execution feedback drives the synthesis of candidate solutions. This process is formalized as a state-action search tree optimization, balancing code correctness with editing efficiency. Evaluations on the Geeks4Geeks and HumanEval benchmarks demonstrate that ARCS significantly outperforms traditional prompting methods in translation and generation quality. By enabling scalable and precise code synthesis, ARCS offers transformative potential for automating and optimizing code development in supercomputing applications, enhancing computational resource utilization

Bhattarai, Manish [Los Alamos National Labs]↗
NASA NTRS2016

The Mathematics of Dispatchability Revisited

Dispatchability is an important property for the efficient execution of temporal plans where the temporal constraints are represented as a Simple Temporal Network (STN). It has been shown that every STN may be reformulated as a dispatchable STN, and dispatchability ensures that the temporal constraints need only be satisfied locally during execution. Recently it has also been shown that Simple Temporal Networks with Uncertainty, augmented with wait edges, are Dynamically Controllable provided every projection is dispatchable. Thus, the dispatchability property has both theoretical and practical interest. One thing that hampers further work in this area is the underdeveloped theory. The existing definitions are expressed in terms of algorithms, and are less suitable for mathematical proofs. In this paper, we develop a new formal theory of dispatchability in terms of execution sequences. We exploit this to prove a characterization of dispatchability involving the structural properties of the STN graph. This facilitates the potential application of the theory to uncertainty reasoning.

control↗
NASA NTRS1996

Squeezed States and Particle Production in High Energy Collisions

Using the 'quantum optical approach' we propose a model of multiplicity distributions in high energy collisions based on squeezed coherent states. We show that the k-mode squeezed coherent state is the most general one in describing hadronic multiplicity distributions in particle collision processes, describing not only p(bar-p) collisions but e(+)e(-), vp and diffractive collisions as well. The reason for this phenomenological fit has been gained by working out a microscopic theory in which the squeezed coherent sources arise naturally if one considers the Lorentz squeezing of hadrons and works in the covariant phase space formalism.

Bambah, Bindu A.↗
NASA NTRS1999

Analyzing Mode Confusion via Model Checking

Mode confusion is one of the most serious problems in aviation safety. Today's complex digital flight decks make it difficult for pilots to maintain awareness of the actual states, or modes, of the flight deck automation. NASA Langley leads an initiative to explore how formal techniques can be used to discover possible sources of mode confusion. As part of this initiative, a flight guidance system was previously specified as a finite Mealy automaton, and the theorem prover PVS was used to reason about it. The objective of the present paper is to investigate whether state-exploration techniques, especially model checking, are better able to achieve this task than theorem proving and also to compare several verification tools for the specific application. The flight guidance system is modeled and analyzed in Murphi, SMV, and Spin. The tools are compared regarding their system description language, their practicality for analyzing mode confusion, and their capabilities for error tracing and for animating diagnostic information. It turns out that their strengths are complementary.

Luettgen, Gerald↗
NASA NTRS2002

Formal Verification for a Next-Generation Space Shuttle

This paper discusses the verification and validation (V&2) of advanced software used for integrated vehicle health monitoring (IVHM), in the context of NASA's next-generation space shuttle. We survey the current VBCV practice and standards used in selected NASA projects, review applicable formal verification techniques, and discuss their integration info existing development practice and standards. We also describe two verification tools, JMPL2SMV and Livingstone PathFinder, that can be used to thoroughly verify diagnosis applications that use model-based reasoning, such as the Livingstone system.

Nelson, Stacy D.↗
NASA NTRS1992

Purposive discovery of operations

The Generate, Prune & Prove (GPP) methodology for discovering definitions of mathematical operators is introduced. GPP is a task within the IL exploration discovery system. We developed GPP for use in the discovery of mathematical operators with a wider class of representations than was possible with the previous methods by Lenat and by Shen. GPP utilizes the purpose for which an operator is created to prune the possible definitions. The relevant search spaces are immense and there exists insufficient information for a complete evaluation of the purpose constraint, so it is necessary to perform a partial evaluation of the purpose (i.e., pruning) constraint. The constraint is first transformed so that it is operational with respect to the partial information, and then it is applied to examples in order to test the generated candidates for an operator's definition. In the GPP process, once a candidate definition survives this empirical prune, it is passed on to a theorem prover for formal verification. We describe the application of this methodology to the (re)discovery of the definition of multiplication for Conway numbers, a discovery which is difficult for human mathematicians. We successfully model this discovery process utilizing information which was reasonably available at the time of Conway's original discovery. As part of this discovery process, we reduce the size of the search space from a computationally intractable size to 3468 elements.

Sims, Michael H.↗
NASA NTRS2008

Efficient Probabilistic Diagnostics for Electrical Power Systems

We consider in this work the probabilistic approach to model-based diagnosis when applied to electrical power systems (EPSs). Our probabilistic approach is formally well-founded, as it based on Bayesian networks and arithmetic circuits. We investigate the diagnostic task known as fault isolation, and pay special attention to meeting two of the main challenges . model development and real-time reasoning . often associated with real-world application of model-based diagnosis technologies. To address the challenge of model development, we develop a systematic approach to representing electrical power systems as Bayesian networks, supported by an easy-to-use speci.cation language. To address the real-time reasoning challenge, we compile Bayesian networks into arithmetic circuits. Arithmetic circuit evaluation supports real-time diagnosis by being predictable and fast. In essence, we introduce a high-level EPS speci.cation language from which Bayesian networks that can diagnose multiple simultaneous failures are auto-generated, and we illustrate the feasibility of using arithmetic circuits, compiled from Bayesian networks, for real-time diagnosis on real-world EPSs of interest to NASA. The experimental system is a real-world EPS, namely the Advanced Diagnostic and Prognostic Testbed (ADAPT) located at the NASA Ames Research Center. In experiments with the ADAPT Bayesian network, which currently contains 503 discrete nodes and 579 edges, we .nd high diagnostic accuracy in scenarios where one to three faults, both in components and sensors, were inserted. The time taken to compute the most probable explanation using arithmetic circuits has a small mean of 0.2625 milliseconds and standard deviation of 0.2028 milliseconds. In experiments with data from ADAPT we also show that arithmetic circuit evaluation substantially outperforms joint tree propagation and variable elimination, two alternative algorithms for diagnosis using Bayesian network inference.

Mengshoel, Ole J.↗
NASA NTRS1990

Theoretical line shapes for rotational spectra of HCl in Ar

An interaction potential for HCl-Ar recently derived from spectra of van der Waals complexes (Hutson,1988) has been used to obtain converged close-coupling scattering S matrices from which pressure broadening (linewidth, line shift, and line coupling) cross sections have been computed within the Fano-Ben-Reuven formalism. Linewidths agree well with experimental data with the exception of the 0-1 line at low temperatures (an error of about 15 percent at 125 K). Line shifts, especially the largest, for the 0-1 line, are also in reasonable accord with experimental data. Line coupling is predicted to be quite small. The coupled-states molecular scattering approximation is found to be accurate except at very low collision energies. The infinite-order sudden approximations, on the other hand, is not reliable for this system. Inelastic scattering out of the spectroscopic levels accounts for only a fraction of the linewidth at thermal energies, especially in the lower rotational levels.

Green, Sheldon↗
NASA NTRS2011

Developer Tools for Evaluating Multi-Objective Algorithms

Multi-objective algorithms for scheduling offer many advantages over the more conventional single objective approach. By keeping user objectives separate instead of combined, more information is available to the end user to make trade-offs between competing objectives. Unlike single objective algorithms, which produce a single solution, multi-objective algorithms produce a set of solutions, called a Pareto surface, where no solution is strictly dominated by another solution for all objectives. From the end-user perspective a Pareto-surface provides a tool for reasoning about trade-offs between competing objectives. From the perspective of a software developer multi-objective algorithms provide an additional challenge. How can you tell if one multi-objective algorithm is better than another? This paper presents formal and visual tools for evaluating multi-objective algorithms and shows how the developer process of selecting an algorithm parallels the end-user process of selecting a solution for execution out of the Pareto-Surface.

multi-objective optimization↗
NASA NTRS2020

Burning Embers: Towards More Transparent and Robust Climate-change Risk Assessments

The Intergovernmental Panel on Climate Change (IPCC) reports provide policy-relevant insights about climate impacts, vulnerabilities and adaptation through a process of peer-reviewed literature assessments underpinned by expert judgement. An iconic output from these assessments is the burning embers diagram, first used in the Third Assessment Report to visualize reasons for concern, which aggregate climate-change-related impacts and risks to various systems and sectors. These burning embers use colour transitions to show changes in the assessed level of risk to humans and ecosystems as a function of global mean temperature. In this Review, we outline the history and evolution of the burning embers and associated reasons for concern framework, focusing on the methodological approaches and advances. While the assessment framework and figure design have been broadly retained over time, refinements in methodology have occurred, including the consideration of different risks, use of confidence statements, more formalized protocols and standardized metrics. Comparison across reports reveals that the risk level at a given temperature has generally increased with each assessment cycle, reflecting accumulating scientific evidence. For future assessments, an explicit, transparent and systematic process of expert elicitation is needed to enhance comparability, quality and credibility of burning embers.

burning embers diagram↗
NASA NTRS1985

Perspectives on knowledge in engineering design

Various perspectives are given of the knowledge currently used in engineering design, specifically dealing with knowledge-based expert systems (KBES). Constructing an expert system often reveals inconsistencies in domain knowledge while formalizing it. The types of domain knowledge (facts, procedures, judgments, and control) differ from the classes of that knowledge (creative, innovative, and routine). The feasible tasks for expert systems can be determined based on these types and classes of knowledge. Interpretive tasks require reasoning about a task in light of the knowledge available, where generative tasks create potential solutions to be tested against constraints. Only after classifying the domain by type and level can the engineer select a knowledge-engineering tool for the domain being considered. The critical features to be weighed after classification are knowledge representation techniques, control strategies, interface requirements, compatibility with traditional systems, and economic considerations.

Rasdorf, W. J.↗
NASA NTRS2005

What Sensing Tells Us: Towards a Formal Theory of Testing for Dynamical Systems

Just as actions can have indirect effects on the state of the world, so too can sensing actions have indirect effects on an agent's state of knowledge. In this paper, we investigate "what sensing actions tell us", i.e., what an agent comes to know indirectly from the outcome of a sensing action, given knowledge of its actions and state constraints that hold in the world. To this end, we propose a formalization of the notion of testing within a dialect of the situation calculus that includes knowledge and sensing actions. Realizing this formalization requires addressing the ramification problem for sensing actions. We formalize simple tests as sensing actions. Complex tests are expressed in the logic programming language Golog. We examine what it means to perform a test, and how the outcome of a test affects an agent's state of knowledge. Finally, we propose automated reasoning techniques for test generation and complex-test verification, under certain restrictions. The work presented in this paper is relevant to a number of application domains including diagnostic problem solving, natural language understanding, plan recognition, and active vision.

McIlraith, Sheila↗