Sökning: "Automated Reasoning"
Visar resultat 1 - 5 av 43 avhandlingar innehållade orden Automated Reasoning.
1. Extending the Automated Reasoning Toolbox
Sammanfattning : Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range of problems than the standard ones of satisfiability and derivability. We extend the automated reasoning toolbox by introducing three new tools for analysing problems in first-order logic. Infinox aims to show finite unsatisfiability, i.e. LÄS MER
2. Extending the Automated Reasoning Toolbox
Sammanfattning : Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range of problems than the standard ones of satisfiability and derivability. We extend the automated reasoning toolbox by intro- ducing two new tools for analysing problems in first-order logic. Infinox is aimed at showing finite unsatisfiability, i.e. LÄS MER
3. Reasoning with Bounded Cognitive Resources
Sammanfattning : Reasoning is an essential element of intelligence. Automated reasoning in formal and symbolic systems is a major topic in computer science and artificial intelligence (AI). Programs for computer-assisted and automated theorem proving are being constructed and used by mathematicians and logicians. LÄS MER
4. Efficient Temporal Reasoning with Uncertainty
Sammanfattning : Automated Planning is an active area within Artificial Intelligence. With the help of computers we can quickly find good plans in complicated problem domains, such as planning for search and rescue after a natural disaster. When planning in realistic domains the exact duration of an action generally cannot be predicted in advance. LÄS MER
5. Quantifiers and Theories : A Lazy Approach
Sammanfattning : In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (SMT) and present lazy strategies for improving reasoning within these areas. A lazy strategy works by simplifying a problem, and gradually refines the abstraction only when necessary. LÄS MER