National Repository of Grey Literature 7 records found  Search took 0.01 seconds. 
Modern Planning Algorithms
Binko, Petr ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
This work describes graphplan, satplan and real-time adaptive A* planning algorithms. Through implementation of these algorithms, functionality and assumed attributes (real-time calculation, parallelism) are tested. These tests take place in nontrivial domains. Graphplan and satplan algorithms were tested in block-world, tire-world and bulldozer domains. Results of these tests were compared and displayed in graphs. Real-time adaptive A* algorithm was tested in tire-world domain. Results of these tests were compared with classic A* algorithm. Advantages and disadvantages of these algorithms are also described in this work.
An Automatic Theorem Prover
Mazánek, Martin ; Havlena, Vojtěch (referee) ; Lengál, Ondřej (advisor)
This thesis focuses on implementation of resolution-based automatic theorem prover for propositional and first-order logic. The goal of this thesis is to create simple prover and document the development. Making state-of-the-art prover is not the goal of this thesis. We also present some popular automated theorem provers.
Resolution Method Visualisation
Smetka, Tomáš ; Orság, Filip (referee) ; Rozman, Jaroslav (advisor)
This bachelor’s thesis deals with problems in the area of automated reasoning in propositional and predicate logic. In the theoretical part the propositional and predicate logic is described in connection with the system of its automatic proving with help of resolution method. Further there is described draft and implementation of a program which consists of a terminal and server part. The program looks for a proof if the given formula is impossible to be solved and visualizes every single step which leads to finding of the solution. In conclusion the implementation of solution and the thesis as a whole is evaluated and there are also described additional possibilities of extension.
An Automatic Theorem Prover
Mazánek, Martin ; Havlena, Vojtěch (referee) ; Lengál, Ondřej (advisor)
This thesis focuses on implementation of resolution-based automatic theorem prover for propositional and first-order logic. The goal of this thesis is to create simple prover and document the development. Making state-of-the-art prover is not the goal of this thesis. We also present some popular automated theorem provers.
Resolution Method Visualisation
Smetka, Tomáš ; Orság, Filip (referee) ; Rozman, Jaroslav (advisor)
This bachelor’s thesis deals with problems in the area of automated reasoning in propositional and predicate logic. In the theoretical part the propositional and predicate logic is described in connection with the system of its automatic proving with help of resolution method. Further there is described draft and implementation of a program which consists of a terminal and server part. The program looks for a proof if the given formula is impossible to be solved and visualizes every single step which leads to finding of the solution. In conclusion the implementation of solution and the thesis as a whole is evaluated and there are also described additional possibilities of extension.
Modern Planning Algorithms
Binko, Petr ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
This work describes graphplan, satplan and real-time adaptive A* planning algorithms. Through implementation of these algorithms, functionality and assumed attributes (real-time calculation, parallelism) are tested. These tests take place in nontrivial domains. Graphplan and satplan algorithms were tested in block-world, tire-world and bulldozer domains. Results of these tests were compared and displayed in graphs. Real-time adaptive A* algorithm was tested in tire-world domain. Results of these tests were compared with classic A* algorithm. Advantages and disadvantages of these algorithms are also described in this work.
Řešitel příkladů pro předmět Teoretické základy informatiky
Šimonová, Adriana
Šimonová A., A researcher of examples for a subject of Theoretical basics of informatics. Mendel Univerity in Brno, 2013. Bachelor thesis is focused on the subject - Theoretical basics of informatics, specifically on propositional calculus. In the theoretical part is described a theory of propositional calculus to be understood this issue by readers. In the second part the bachelor thesis is described by the researcher of examples.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.