Date of Publication

2014

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

Subject Categories

Computer Sciences

College

College of Science

Department/Unit

Mathematics and Statistics

Thesis Adviser

Angelyn R. Lao

Abstract/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.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU017679

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Keywords

Maude (Computer program language)

Upload Full Text

wf_yes

Download

Share

COinS