SMT-Based Reasoning and Planning in TAL
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
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.
Satisfiability Modulo Theories, Temporal Action Logic, automated planning, iPhone, game
IdentifiersURN: urn:nbn:se:liu:diva-72596ISRN: LITH-IDA-EX-A--10/032--SEOAI: oai:DiVA.org:liu-72596DiVA: diva2:460309
Subject / course
Computer science (20-credit final thesis, D level)