Sökning: "automated theorem proving"

Visar resultat 11 - 15 av 16 avhandlingar innehållade orden automated theorem proving.

  1. 11. A First Order Extension of Stålmarck's Method

    Författare :Magnus Björk; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Tableaux; Automated Theorem Proving; Stålmarck s Method;

    Sammanfattning : Stålmarck's method is an algorithm that decides validity of formulae in propositional logic. It resembles many tableaux method, but uses a special branch-and-merge-rule, called the dilemma rule. The dilemma rule creates two branches, where a formula (called the dilemma formula) is assumed to be false in one branch and true in the other one. LÄS MER

  3. 12. Building Verified Hardware and Verified Stacks in HOL

    Författare :Andreas Lööw; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; hardware synthesis; compilers; formal verification; interactive theorem proving;

    Sammanfattning : This thesis explores building provably correct software and hardware inside the HOL4 interactive theorem prover. Interactive theorem provers such as HOL4 are proof environments where manual (human) and automated (machine) proofs can be composed in logically safe ways and all proof steps (be it manual or automated) are mechanically checked. LÄS MER

  4. 13. On Simultaneous Rigid E-Unification

    Författare :Margus Veanes; Andrei Voronkov; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computing Science;

    Sammanfattning : Automated theorem proving methods in classical logic with equality that are based on the Herbrand theorem, reduce to a problem called Simultaneous Rigid E-Unification, or SREU for short. Recent developments show that SREU has also close connections with intuitionistic logic with equality, second-order unification, some combinatorial problems and finite tree automata. LÄS MER

  5. 14. Deductive Planning and Composite Actions in Temporal Action Logic

    Författare :Martin Magnusson; Patrick Doherty; John-Jules Meyer; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Temporal Action Logic; deductive planning; composite actions; interval algebra; constraint logic programming; execution monitoring; Computer science; Datalogi;

    Sammanfattning : Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. LÄS MER

  7. 15. Reasoning with Bounded Cognitive Resources

    Författare :Abdul Rahim Nizamani; Göteborgs universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Artificial general intelligence; logical reasoning; inductive learning; proof systems; bounded cognitive resources; cognitive modeling;

    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