Change search
ReferencesLink to record
Permanent link

Direct link
SMT-Based Reasoning and Planning in TAL
Linköping University, Department of Computer and Information Science.
2010 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Automated planning as a satisfiability problem is a method developed in theearly nineties. It has some known disadvantages, such as its inefficient encod-ing of numbers. The field of Satisfiability Modulo Teories tries to connectalready established solvers for e.g. linear constraints into SAT-solvers in orderto make reasoning about numerical values more efficient. This thesis combines planning as satisfiability and SMT to perform efficientreasoning about actions that occupy realistic time in Temporal Action Logic,a formalism developed at Linköping University for reasoning about action andchange.

Place, publisher, year, edition, pages
2010. , 95 p.
Keyword [en]
Satisfiability Modulo Theories, Temporal Action Logic, automated planning, iPhone, game
National Category
Computer Systems
URN: urn:nbn:se:liu:diva-72596ISRN: LITH-IDA-EX-A--10/032--SEOAI: diva2:460309
Subject / course
Computer science (20-credit final thesis, D level)
Available from: 2011-12-15 Created: 2011-11-29 Last updated: 2011-12-15Bibliographically approved

Open Access in DiVA

fulltext(1206 kB)329 downloads
File information
File name FULLTEXT01.pdfFile size 1206 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Hallin, Magnus
By organisation
Department of Computer and Information Science
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 329 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 81 hits
ReferencesLink to record
Permanent link

Direct link