Sökning: "Logic Programming"

Visar resultat 6 - 10 av 78 avhandlingar innehållade orden Logic Programming.

  1. 6. Logic programming with external procedures : an implementation

    Författare :Andreas Kågedal; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This work aims at combining logic programs with functions written in other languages, such that the combination preserves the declarative semantics of the logic program. S-Unification, as defined by S. Bonnier and J. Maluszynski, provides a theoretical foundation for this. LÄS MER

  3. 7. Automated Theorem Proving with Extensions of First-Order Logic

    Författare :Evgenii Kotelnikov; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; clausal normal form; Program Verification; automated theorem proving; program analysis; TPTP; Vampire; first-order logic;

    Sammanfattning : Automated theorem provers are computer programs that check whether a logical conjecture follows from a set of logical statements. The conjecture and the statements are expressed in the language of some formal logic, such as first-order logic. LÄS MER

  4. 8. Executable Formal Descriptions for Software Design : Logic and Logic Programming as a Design Tool

    Författare :Lars Oestreicher; Uppsala universitet; []
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  5. 9. On Formal Specification and Verification of Function Block Applications in Industrial Control Logic Development

    Författare :Oscar Ljungkrantz; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; safety logic; function block; IEC 61131; software requirements and specification; formal verification; reusable automation component RAC ; temporal logic; manufacturing automation software; programmable logic controller PLC ; model checking;

    Sammanfattning : Developing a control system for an automated manufacturing system is a challenging task. In addition to controlling and coordinating the machines and robots used in the production, the safety of the operators must be assured. LÄS MER

  7. 10. 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