Home   >   CSC-OpenAccess Library   >    Manuscript Information
Automated Education Propositional Logic Tool (AEPLT): Used For Computation in Discrete Mathematics
J. Mbale
Pages - 27 - 33     |    Revised - 15-11-2012     |    Published - 31-12-2012
Volume - 3   Issue - 1    |    Publication Date - October 2012  Table of Contents
MORE INFORMATION
KEYWORDS
Compound Proposition, Propositional Variables, Propositional Logic, Truth Table, Connective, SEMINT Specific Parser
ABSTRACT
The Automated Education Propositional Logic Tool (AEPLT) is envisaged. The AEPLT is an automated tool that simplifies and aids in the calculation of the propositional logics of compound propositions of conjuction, disjunction, conditional, and bi-conditional. The AEPLT has an architecture where the user simply enters the propositional variables and the system maps them with the right connectives to form compound proposition or formulas that are calculated to give the desired solutions. The automation of the system gives a guarantee of coming up with correct solutions rather than the human mind going through all the possible theorems, axioms and statements, and due to fatigue one would bound to miss some steps. In addition the AEPL Tool has a user friendly interface that guides the user in executing operations of deriving solutions.
CITED BY (1)  
1 Sheeba, A., & Arumugam, C. (2014). User-Centric Design for Mathematical Web Services. Advances in Human-Computer Interaction, 2014.
1 Google Scholar 
2 CiteSeerX 
3 refSeek 
4 Scribd 
5 PdfSR 
A. E. Fleury. “Evaluating discrete mathematics exercises”, SIGCSETechnical Symposium on Computer Science Education, 1993, pp. 73-77.
A. T. Berztiss. “The why and how of discrete structures”, SIGCSE Technical Symposium on Computer Science Education, 1976, pp. 22-25.
A. Tucker, (editor). “Computing curricula 1991: report of the ACM/IEEE-CS Joint curriculum task force”, ACM Press, 1991.
D. Gries, and F. B. Schneider. “A logical approach to discrete math,” Springer-Verlag, New York, 1993.
E. W. Dijkstra. “On the cruelty of really teaching computing science,” Communications of the ACM, December 1989, pp. 1398-1404.
H. Saiedian. “Towards more formalism in software engineering education”, SIGCSE Technical Symposium on Computer Science Education, 1993, pp. 193-197.
http://docs.google.com/
http://gear.kku.ac.pitt.edu/
http://www.cs.pitt.edu/
J. P. Cohoon and J. C. Knight. “Connecting Discrete Mathematics and Software Engineering,” 36th ASEE/IEEE Frontiers in Education Conference, San Diego, CA, October 28 – 31, 2006.
J. P. Tremblay, and R. Manohar. “A first course in discrete structures with applications to computer science,” SIGCSE Technical Symposium on Computer Science Education, 1974,pp. 155-160.
J. W. McGuffee. “The discrete mathematics enhancement project”, Journal of Computing in Small Colleges, 2002, pp. 162-166.
J. Woodcock, and M. Loomes. “Software Engineering Mathematics” Software Engineering Institute, Series in Software Engineering, 1988.
K. Heninger. “Specifying Software Requirements Complex Systems: New Techniques and Their Application”, IEEE Transactions on Software Engineering, Vol. SE-6, No. 1, January 1980.
mason.gmu.edu/~asamsono/teaching/math125/Lecture1.pdf · PDF file
R. E. Prather. “Another look at the discrete structures course”, SIGCSE Technical Symposium on Computer Science Education, 1976, pp. 247-252.
Robin Hirsch. www.cs.ecl.ac.uk/staff/r.hirsch//teaching/1b12/
V. L. Almstrum, C. N. Dean, D. Goelman, T. B. Hilburn, and J. Smith. “ITiCSE 2000 working group report: support for teaching formal methods,” SIGCSE Bulletin, June 2001.
www-groups.dcs.st-and.ac.uk/history/Mathematicians/Boole.html
www.coursehero.com/file/2552944/s11propositionallogicBW.
Dr. J. Mbale
- Namibia
mbalej@yahoo.com