Thema3444: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Serge Stratan (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Abschlussarbeit |Titel DE=Planning problems in petri nets and fluent calculus |Titel EN=Planning problems in petri nets and fluent calculus |Vorname=Ferdian…“) |
Serge Stratan (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| (Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt) | |||
| Zeile 1: | Zeile 1: | ||
{{Abschlussarbeit | {{Abschlussarbeit | ||
|Titel DE=Planning problems in | |Titel DE=Planning problems in Petri Nets and Fluent Calculus | ||
|Titel EN=Planning problems in | |Titel EN=Planning problems in Petri Nets and Fluent Calculus | ||
|Vorname=Ferdian | |Vorname=Ferdian | ||
|Nachname=Jovan | |Nachname=Jovan | ||
| Zeile 8: | Zeile 8: | ||
|Forschungsgruppe=Wissensverarbeitung | |Forschungsgruppe=Wissensverarbeitung | ||
|Abschlussarbeitsstatus=Abgeschlossen | |Abschlussarbeitsstatus=Abgeschlossen | ||
|Abgabe=2014 | |Beginn=2014/04/04 | ||
|Abgabe=2014/04/04 | |||
|Ergebnisse=Thesis jovan.pdf | |||
|Beschreibung DE=In this thesis we discuss conjunctive planning problems in the context of the fluent | |||
calculus and Petri nets. We show that both formalisms are equivalent in solving these | |||
problems. Thereafter, we extend actions to contain preconditions as well as obstacles. | |||
This requires to extend the fluent calculus as well as Petri nets. Again, we show that | |||
both extended formalisms are equivalent. Inspired from Petri nets, we add real-valued | |||
information to conjunctive planning problems. We show that the fluent calculus is | |||
capable in solving conjunctive planning problems with real-valued information.<br/> | |||
Keyword: Petri nets, fluent calculus, equational logic programming, conjunctive planning | |||
problems | |||
|Beschreibung EN=In this thesis we discuss conjunctive planning problems in the context of the fluent | |||
calculus and Petri nets. We show that both formalisms are equivalent in solving these | |||
problems. Thereafter, we extend actions to contain preconditions as well as obstacles. | |||
This requires to extend the fluent calculus as well as Petri nets. Again, we show that | |||
both extended formalisms are equivalent. Inspired from Petri nets, we add real-valued | |||
information to conjunctive planning problems. We show that the fluent calculus is | |||
capable in solving conjunctive planning problems with real-valued information.<br/> | |||
Keyword: Petri nets, fluent calculus, equational logic programming, conjunctive planning | |||
problems | |||
}} | }} | ||
Aktuelle Version vom 13. Dezember 2016, 22:40 Uhr
Planning problems in Petri Nets and Fluent Calculus
Masterarbeit von Ferdian Jovan
- Betreuer Steffen Hölldobler
- Wissensverarbeitung
- 04. April 2014 – 04. April 2014
- Download
In this thesis we discuss conjunctive planning problems in the context of the fluent
calculus and Petri nets. We show that both formalisms are equivalent in solving these
problems. Thereafter, we extend actions to contain preconditions as well as obstacles.
This requires to extend the fluent calculus as well as Petri nets. Again, we show that
both extended formalisms are equivalent. Inspired from Petri nets, we add real-valued
information to conjunctive planning problems. We show that the fluent calculus is
capable in solving conjunctive planning problems with real-valued information.
Keyword: Petri nets, fluent calculus, equational logic programming, conjunctive planning
problems
