Generating truth values and tic-tac-toe game configurations using Maude
Rewriting logic is reflective of mathematical logic and it can be used to express logical statements of any kind. This feature is embedded in Maude, which makes it an ideal programming language in terms of rewriting logic. In this paper, we created modules to generate truth table given the variables...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2014
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/17987 https://animorepository.dlsu.edu.ph/context/etd_bachelors/article/18500/viewcontent/thesis_paper2.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Summary: | Rewriting logic is reflective of mathematical logic and it can be used to express logical statements of any kind. This feature is embedded in Maude, which makes it an ideal programming language in terms of rewriting logic. In this paper, we created modules to generate truth table given the variables and the logical operators AND, OR, NOT, and XOR. Since Maude is flexible, we can easily modify the number of variables we use in the module. In particular, we used the module that accepts two variables and compared it to an existing C++ program which also accepts two variables. By doing so, we were able to show the advantages and disadvantages of using Maude instead of another language when it comes to rewriting logic. To support the claim that Maude can be used to represent any logical problem, we also developed modules that processed and analyzed all the winning combinations of Tic-Tac-Toe. We conclude with some remarks about the efficiency of Maude when it comes to rewriting logic as opposed to using the limited functionalities of object-oriented type of programming languages. |
---|