Thema3481: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Sibylle Möhle (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Serge Stratan (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 8: | Zeile 8: | ||
|Forschungsgruppe=Wissensverarbeitung | |Forschungsgruppe=Wissensverarbeitung | ||
|Abschlussarbeitsstatus=Abgeschlossen | |Abschlussarbeitsstatus=Abgeschlossen | ||
|Beginn=2011 | |Beginn=2011/10/21 | ||
|Abgabe=2011 | |Abgabe=2011/10/21 | ||
|Beschreibung EN= | |Ergebnisse=Report11-05.pdf | ||
|Beschreibung DE=SAT solvers have been already successfully applied in several industrial fields, which are | |||
not directly related to propositional logic. In this work, the periodic event scheduling | |||
problem (PESP) will be presented and, furthermore, the order encoding from a PESP | |||
instance to a SAT instance. The N P-complete PESP is particularly important in several | |||
traffic scenarios with periodic properties. Most native domain solvers cannot solve large | |||
instances within a given time frame. This will be omitted by a rather short time consuming | |||
conversion from PESP to SAT and a fast state-of-the-art SAT solver, in order | |||
to achieve a fast calculated solution of a PESP instance. | |||
|Beschreibung EN=SAT solvers have been already successfully applied in several industrial fields, which are | |||
not directly related to propositional logic. In this work, the periodic event scheduling | |||
problem (PESP) will be presented and, furthermore, the order encoding from a PESP | |||
instance to a SAT instance. The N P-complete PESP is particularly important in several | |||
traffic scenarios with periodic properties. Most native domain solvers cannot solve large | |||
instances within a given time frame. This will be omitted by a rather short time consuming | |||
conversion from PESP to SAT and a fast state-of-the-art SAT solver, in order | |||
to achieve a fast calculated solution of a PESP instance. | |||
}} | }} | ||
Aktuelle Version vom 13. Dezember 2016, 22:28 Uhr
Polynomial Reduction from PESP to SAT
Studienarbeit von Peter Großmann
- Betreuer Peter Steinke
- Wissensverarbeitung
- 21. Oktober 2011 – 21. Oktober 2011
- Download
SAT solvers have been already successfully applied in several industrial fields, which are
not directly related to propositional logic. In this work, the periodic event scheduling problem (PESP) will be presented and, furthermore, the order encoding from a PESP instance to a SAT instance. The N P-complete PESP is particularly important in several traffic scenarios with periodic properties. Most native domain solvers cannot solve large instances within a given time frame. This will be omitted by a rather short time consuming conversion from PESP to SAT and a fast state-of-the-art SAT solver, in order to achieve a fast calculated solution of a PESP instance.
