Browsing by Subject "Prolog"

Now showing 1 - 3 of 3

Open Access
Experiments in integrating constraints with logical reasoning for robotic planning within the twelf logical framework and the prolog language
(2008) Duatepe, Mert
The underlying domain of various application areas, especially real-time systems and robotic applications, generally includes a combination of both discrete and continuous properties. In robotic applications, a large amount of different approaches are introduced to solve either a discrete planning or control theoretic problem. Only a few methods exist to solve the combination of them. Moreover, these methods fail to ensure a uniform treatment of both aspects of the domain. Therefore, there is need for a uniform framework to represent and solve such problems. A new formalism, the Constrained Intuitionistic Linear Logic (CILL), combines continuous constraint solvers with linear logic. Linear logic has a great property to handle hypotheses as resources, easily solving state transition problems. On the other hand, constraint solvers deal well with continuous problems defined as constraints. Both properties of CILL gives us powerful ways to express and reason about the robotics domain. In this thesis, we focus on the implementation of CILL in both the Twelf Logical Framework and Prolog. The reader of this thesis can find answers of why classical aspects are not proper for the robotics domain, what advantages one can gain from intuitionism and linearity, how one can define a simple robotic domain in a logical formalism, how a proof in logical system corresponds to a plan in the robotic domain, what the advantages and disadvantages of logical frameworks and Prolog have and how the implementation of CILL can or cannot be done using both Twelf Logical Framework and Prolog.
Open Access
An intelligent backtracking schema in a logic programming environment
(ACM, 1997) Cicekli, I.
We present a new method to represent variable bindings in the Warren Abstract Machine (WAM), so that the ages of variable bindings can be easily found using this new representation in our intelligent backtracking schema. The age of a variable bound to a non-variable term is the youngest choice point such that backtracking to that choice point can make that variable an unbound variable again. The procedure backtracking point is the choice point of the procedure currently being executed or the choice point of its first ancestor having a choice point. Variable ages and procedure backtracking points are used in the process of figuring out backtracking points in our intelligent backtracking schema. Our intelligent backtracking schema performs much better than the results of other intelligent backtracking methods in the literature for deterministic programs, and its performance for non-deterministic programs are comparable with their results.
Open Access
A Parallel Prolog emulator
(1988) Gürsoy, Attila
There are various parallel Prolog execution models proposed so far. In this study, an emulator has been developed to test the execution model PPEM. The emulator is used to collect data to evaluate the performance of the model. The underlying architecture is assumed to be a tightly coupled multiprocessor system. Some implementation difficulties faced, which are not apparent in the definition of PPEM are discussed, and performance results are presented.