Hochschulschrift
Static termination analysis for prolog using term rewriting and SAT solving
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
II, 174 S.
- Language
-
Englisch
- Notes
-
Zugl.: Aachen, Techn. Hochsch., Diss. 2008
- Bibliographic citation
-
Aachener Informatik-Berichte ; 2008,17
- Keyword
-
Terminierung ; PROLOG ; Termersetzungssystem ; Erfüllbarkeitsproblem ; Automatisches Beweisverfahren ; Verifikation
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
RWTH, Fachgruppe Informatik
- (when)
-
2008
- Creator
- URN
-
urn:nbn:de:hbz:82-opus-26300
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:51 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Schneider-Kamp, Peter
- RWTH, Fachgruppe Informatik
Time of origin
- 2008
Other Objects (12)
Termination Proofs of Rewriting Systems
On termination of single pushout graph rewriting
SAT Solving mit GPU Unterstützung
Advanced Methods for SAT Solving
SAT-Solving mit GPU-Unterstützung
SAT solving with message passing
Termination of cycle rewriting by transformation and matrix interpretation
The DP framework for proving termination of term rewriting
Termination proofs and derivation lengths in term rewriting systems
SAT Solving with GPU Accelerated Inprocessing
Symbolic Causality Checking Using SAT-Solving
SAT solving with GPU accelerated inprocessing
Termination Proofs of Rewriting Systems
On termination of single pushout graph rewriting
SAT Solving mit GPU Unterstützung
Advanced Methods for SAT Solving
SAT-Solving mit GPU-Unterstützung
SAT solving with message passing
Termination of cycle rewriting by transformation and matrix interpretation
The DP framework for proving termination of term rewriting
Termination proofs and derivation lengths in term rewriting systems
SAT Solving with GPU Accelerated Inprocessing
Symbolic Causality Checking Using SAT-Solving
SAT solving with GPU accelerated inprocessing
Termination Proofs of Rewriting Systems
On termination of single pushout graph rewriting
SAT Solving mit GPU Unterstützung
Advanced Methods for SAT Solving
SAT-Solving mit GPU-Unterstützung
SAT solving with message passing
Termination of cycle rewriting by transformation and matrix interpretation
The DP framework for proving termination of term rewriting
Termination proofs and derivation lengths in term rewriting systems
SAT Solving with GPU Accelerated Inprocessing
Symbolic Causality Checking Using SAT-Solving