Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 13 of 13 for “"Automatic Reasoning"”.

  1. Symbolic reachability analysis for rewrite theories

    … presents a significant step forward in automatic and semi-automatic reasoning for reachability properties of rewriting logic specifications, a major research goal in the current state of the art. In particular, this work develops deductive techniques for reasoning symbolically about …

    uiuc Repository record for Symbolic reachability analysis for rewrite theories (opens in a new tab)

  2. Parallelizing an interactive theorem prover : functional programming and proofs with ACL2

    … an interactive setting. This research explores automatically using these additional resources to lessen the delay between when users submit conjectures to the theorem prover and when they receive feedback from the prover that is useful in discovering how to successfully complete the proof of a …

    texas Repository record for Parallelizing an interactive theorem prover : functional programming and proofs with ACL2 (opens in a new tab)

  3. Design and evaluation of the FAMILIAR tool

    … Model scrIpt Language for manipulation and Automatic Reasoning) is a Domain-Specific Modeling Language (DSML) for manipulating Feature Models (FMs). One of the strengths of the FAMILIAR language is that it provides rich semantics for FM composition operators (aggregate, merge, insert) as …

    colostate Repository record for Design and evaluation of the FAMILIAR tool (opens in a new tab)

  4. Security information management with frame-based attack presentation and first-order reasoning

    … Attack Representation and First-order logic Automatic Reasoning (FAR-FAR) using linguistics and First-order Logic (FOL) based approaches. Techniques based on linguistics can provide efficient solutions to acquire semantic information from alert contexts, while FOL can tackle a wide variety of …

    njit Repository record for Security information management with frame-based attack presentation and first-order reasoning (opens in a new tab)

  5. On reasoning about action and change in the fluent calculus

    <p>We investigate the possibilities for automatic reasoning about action and change in the Fluent Calculus. To this end, by relating reasoning about action and change in the Fluent Calculus to model checking of dynamic systems, we pursue a systematic approach to analysing Fluent Calculus domains. …

    soton Download PDF for On reasoning about action and change in the fluent calculus (opens in a new tab)

  6. Dynamic fixture planning in virtual environments

    … environmental factors into fixture planning. Automatic fixture planning using VR can provide a viable way for industries. This thesis develops automated approaches to fixture planning in a virtual environment (VE). It intends to address two important issues: automatic algorithms for fixture …

    manitoba Repository record for Dynamic fixture planning in virtual environments (opens in a new tab)

  7. Plural semantics for natural language understanding — a computational proof-theoretic approach

    … problems of representing, disambiguating and reasoning with plurals from a computational perspective. The work defines a computationally suitable representation for important plural constructions, proposes a tractable resolution algorithm for semantic plural ambiguities, and integrates an …

    zurich

  8. Formalização da lógica linear em Coq

    … tactics in Coq that allow us to perform semi-automatic reasoning.

    brazil-ufrn Repository record for Formalização da lógica linear em Coq (opens in a new tab)

  9. Explorations in static pointer analysis: adaptive scalability and strong guarantees

    Static program analysis aims to automatically reason about certain properties a given program might exhibit under all possible executions without actually observing such executions. Static pointer analysis is a major subcategory that focuses on the objects that program expressions might point to …

    greece Repository record for Explorations in static pointer analysis: adaptive scalability and strong guarantees (opens in a new tab)

  10. Recovering structural information for better static analysis

    … understanding of program behavior, by means of automatic reasoning that requires only the program’s source code and not any actual execution. To reach a truly broad level of program understanding, static analysis techniques need to create an abstraction of memory that covers all possible …

    greece Repository record for Recovering structural information for better static analysis (opens in a new tab)

  11. Integrating Ontology-Based Information Extraction Systems and Spatial Modeling for Land Use Analysis and Simulation

    Information Extraction (IE) is defined as the automatic identification and extraction of a predefined set of concepts, relevant to a specific domain of knowledge, ignoring irrelevant information. IE converts unstructured text into structured data and extracts the required information. IE is to some …

    regina Repository record for Integrating Ontology-Based Information Extraction Systems and Spatial Modeling for Land Use Analysis and Simulation (opens in a new tab) Download PDF for Integrating Ontology-Based Information Extraction Systems and Spatial Modeling for Land Use Analysis and Simulation (opens in a new tab)

  12. Σταθμισμένα ασαφή λογικά προγράμματα: αναπαράσταση, συλλογιστική και προσαρμογή

    … alia due to the need to perform efficiently automatic reasoning tasks within the currently under development semantic web. This need is however not fully covered by the expressivity of first order logic, as in several cases there is the need to reason with imperfect knowledge. Fuzzy logic …

    greece Repository record for Σταθμισμένα ασαφή λογικά προγράμματα: αναπαράσταση, συλλογιστική και προσαρμογή (opens in a new tab)

  13. ON THE APPLICATIONS OF INTERACTIVE THEOREM PROVING IN COMPUTATIONAL SCIENCES AND ENGINEERING

    … functions; third, we develop a set of practical automatic proof strategies based on formally verified theorems. The contributions of Part II have become part of the ultra-reliable NASA PVS standard library.

    mtu Repository record for ON THE APPLICATIONS OF INTERACTIVE THEOREM PROVING IN COMPUTATIONAL SCIENCES AND ENGINEERING (opens in a new tab)