Show simple item record

dc.contributor.advisorSaranlı, Uluçen_US
dc.contributor.authorKortik, Sıtaren_US
dc.date.accessioned2016-01-08T18:12:38Z
dc.date.available2016-01-08T18:12:38Z
dc.date.issued2010
dc.identifier.urihttp://hdl.handle.net/11693/15054
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2010.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2010.en_US
dc.descriptionIncludes bibliographical references leaves 74-77.en_US
dc.description.abstractThe main scope of this thesis is implementing a backwards theorem prover with focusing, resource management and constraints within the intuitionistic first-order linear logic for robotic planning problems. To this end, backwards formulations provide a simpler context for experimentation. However, existing backward theorem provers are either implemented without regard to the efficiency of the proofsearch, or when they do, restrict the language to smaller fragments such as Linear Hereditary Harrop Formulas (LHHF). The former approach is unsuitable since it significantly impairs the scalability of the resulting system. The latter family of theorem provers address the scalability issue but impact the expressivity of the resulting language and may not be able to deal with certain non-deterministic planning elements. The proof theory we describe in this thesis enables us to effectively experiment with the use of linearity and continuous constraints to encode dynamic state elements characteristic of robotic planning problems. To this end, we describe a prototype implementation of our system in SWI-Prolog, and also incorporate continuous constraints into the prototype implementation of the system. We support the expressivity and efficiency of our system with some examples.en_US
dc.description.statementofresponsibilityKortik, Sıtaren_US
dc.format.extentxii, 95 leavesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectConstrained intuitionistic first-order linear logicen_US
dc.subjectAutomated theorem provingen_US
dc.subjectBackwards theorem proveren_US
dc.subjectRobotic planningen_US
dc.subjectSWI-Prolog implementation of CFRMen_US
dc.subject.lccTJ211 .K67 2010en_US
dc.subject.lcshRobotics.en_US
dc.subject.lcshRobots--Programming.en_US
dc.subject.lcshIntuitionistic mathematics.en_US
dc.subject.lcshLogic, Symbolic and mathematical.en_US
dc.titleA backwards theorem prover with focusing, resource management and constraints for robotic planning within intuitionistic linear logicen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB120020


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record