Search
Now showing items 1-9 of 9
Learning for Classical Planning
Learning for Classical Planning
dissertation thesis (DEFENDED)
Advisor: Barták, Roman
Date Issued: 2009
Date of defense: 25. 09. 2009
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: This thesis is mainly about classical planning for artificial intelligence (AI). In planning, we deal with searching for a sequence of actions that changes the environment from a given initial state to a goal state. Planning ...
Subgraphs of Hypercubes - Embeddings with Restrictions or Prescriptions
Subgraphs of Hypercubes - Embeddings with Restrictions or Prescriptions
dissertation thesis (DEFENDED)
Advisor: Koubek, Václav
Date Issued: 2006
Date of defense: 04. 10. 2006
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found
Transformation of Logic Programs
Transformace logických programů
dissertation thesis (DEFENDED)
Advisor: Štěpánek, Petr
Date Issued: 2008
Date of defense: 30. 09. 2008
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: This paper is a contribution to improving computational e fficiency of de nite Prolog programs using Unfold/Fold (U/F) strategy with homeomorphic embedding as a control heuristic. Unfold/Fold strategy is an alternative to ...
Global Constraints in Scheduling
Globalni podminky v rozvrhovani
dissertation thesis (DEFENDED)
Advisor: Barták, Roman
Date Issued: 2007
Date of defense: 22. 08. 2007
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: In this place, I would like to say my best thanks to everyone who supported me in my work and helped me along my whole Ph.D. study. First of all I owe a major debt to my supervisor Doc. RNDr. Roman Barták, Ph.D. for his ...
Ultrafilters and Small Sets
Ultrafiltry a malé série
dissertation thesis (DEFENDED)
Advisor: Simon, Petr
Date Issued: 2006
Date of defense: 28. 04. 2006
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found
Interval Representations of Boolean Functions
Intervalové reprezentace booleovských funkcí
dissertation thesis (DEFENDED)
Advisor: Čepek, Ondřej
Date Issued: 2007
Date of defense: 22. 08. 2007
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: This thesis is dedicated to a research concerning representations of Boolean functions. We present the concept of a representation using intervals of integers. Boolean function f is represented by set I of intervals, if ...
Verefication of Mathematical Proofs
Verefication of Mathematical Proofs
dissertation thesis (DEFENDED)
Advisor: Štěpánek, Petr
Date Issued: 2007
Date of defense: 07. 03. 2007
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: In this thesis we deal with the problem of automatic proving (or disproving) mathematical conjectures using computer programs (usually called automated theorem provers). We address several issues that are important for a ...
Structure of Submodels.Diagonal Indiscernibility in Models of Arithmetics.
Structure of Submodels.Diagonal Indiscernibility in Models of Arithmetics.
dissertation thesis (DEFENDED)
Advisor: Mlček, Josef
Date Issued: 2007
Date of defense: 06. 09. 2007
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found
Constraint Programming in Planning
Omezující podmínky v plánování
dissertation thesis (DEFENDED)
Advisor: Barták, Roman
Date Issued: 2008
Date of defense: 30. 09. 2008
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: This thesis deals with planning problems and Boolean satisfiability problems that represent major challenges for artificial intelligence. Planning problems are stated as finding a sequence of actions that reaches certain ...