Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • 1985-1989  (1)
  • 1975-1979  (2)
Materialart
Erscheinungszeitraum
Jahr
Person/Organisation
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Journal of automated reasoning 3 (1987), S. 343-377 
    ISSN: 1573-0670
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Problems in commonsense and robot planning are approached by methods adapted from program synthesis research; planning is regarded as an application of automated deduction. To support this approach, we introduce a variant of situational logic, called plan theory, in which plans are explicit objects. A machine-oriented deductive-tableau inference system is adapted to plan theory. Equations and equivalences of the theory are built into a unification algorithm for the system. Frame axioms are built into the resolution rule. Special attention is paid to the derivation of conditional and recursive plans. Inductive proofs of theorems for even the simplest planning problems, such as clearing a block, have been found to require challenging generalizations.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Acta informatica 5 (1975), S. 333-352 
    ISSN: 1432-0525
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Summary Several methods for proving that computer programs terminate are presented and illustrated. The methods considered involve (a) using the “no-infinitely-descending-chain” property of well-founded sets (Floyd's approach), (b) bounding a counter associated with each loop (loop approach), (c) showing that some exit of each loop must be taken (exit approach), or (d) inducting on the structure of the data domain (Burstall's approach). We indicate the relative merit of each method for proving termination or non-termination as an integral part of an automatic verification system.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Buch
    Buch
    Amsterdam u.a. :North-Holland,
    Titel: Studies in automatic programming logic
    Autor: Manna, Zohar
    Beteiligte Person(en): Waldinger, Richard
    Verlag: Amsterdam u.a. :North-Holland,
    Erscheinungsjahr: 1977
    Seiten: 192 S.
    Materialart: Buch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...