I.E. something which does the actual logical evaluation? I can do that I think...
::glances over university code::
Hmm - I wrote some dodgy java a while back
I think I can re-read it and design a parser.
Are you after something which proves a predicate string or something more complex?
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Ergh
I've checked my code a little more and all my old uni code does is take a formula (- == NOT, . == AND, * == OR) in pre-order and say if it is "valid" or "satisfiable" or "unsatisfiable"
It's rough and incomplete but may help..
-- EXAMPLE OUTPUT --
The formula -*a-a
Unsatisfiable
The formula *a-a
Valid
The formula .a-a
Unsatisfiable
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Subject says it all.
I wrote something at university covering this.
Are you after something simple - or more of a mini prolog parser?
Something that can abstract the expression and terms to be used in a constraint solver.
I have a handle on the parser, its the evaluator sub-system I am looking for.
I.E. something which does the actual logical evaluation? I can do that I think...
::glances over university code::
Hmm - I wrote some dodgy java a while back
I think I can re-read it and design a parser.
Are you after something which proves a predicate string or something more complex?
Ergh
I've checked my code a little more and all my old uni code does is take a formula (- == NOT, . == AND, * == OR) in pre-order and say if it is "valid" or "satisfiable" or "unsatisfiable"
It's rough and incomplete but may help..
-- EXAMPLE OUTPUT --
The formula -*a-a
Unsatisfiable
The formula *a-a
Valid
The formula .a-a
Unsatisfiable
http://www.ginac.de/
GiNaC, GiNaC is Not a CAS,
(CAS = Computer Algebra System)
It allows creation of integrated systems that embed symbolic manipulations together with more established areas of computer science. It is GPL'd.