Smap

Choose the version you want to view.

Current version:Version message:

Revised the way inference rules are represented.

Click on a tag to show all related programs.

logic logic_programming implicational_logic

Click on the badge to open the comment window for viewing and writing comments.

No comments yet.

Created by llee454 on April 11, 2017 (last modified on April 12, 2017)

0 users favorited this

Description: A simple example illustrating how to use Curry to represent knowledge domains in prepositional logic and generate inferences.

Source code (Latest version):

-- This is a source code template for Curry programs.
main = prove $ Home Kat

data Person
  = Anna
  | Kat

(/\) :: Proposition -> Proposition -> Proposition
p /\ q = And p q

(<---) :: Proposition -> Proposition -> Proposition
p <--- q = Impl p q

(<-/-) :: Proposition -> Proposition -> Proposition
p <-/- q = NImpl p q

(<-/->) :: Proposition -> Proposition -> Proposition
p <-/-> q = (p <-/- q) /\ (q <-/- p)

Not :: Proposition -> Proposition
Not p = PFalse <--- p

prove :: Proposition -> Success
prove p = axiom p
prove p = prove (p /\ q) where q free
prove p = prove (q /\ p) where q free
prove p = prove (p <--- q) & prove q where q free
prove (Not p) = prove (p <--- q) & prove (Not q) where q free
prove (Not p) = prove (p <-/- q) & prove q where q free
prove (Not q) = prove (p <-/- q) & prove p where p free

axiom :: Proposition -> Success
--axioms = Not (Home Anna)
axiom (Home Kat) = success
--axioms = Guilty Anna <-/-> Guilty Kat
--axioms = Guilty Anna <--- Not (Guilty Kat)
--axioms = Guilty Kat <--- Not (Guilty Anna)
--axioms = Guilty x <-/- Not (Home x) where x free
--axioms = Guilty x <--- Home x where x free

Options

Versions

4 versions

Tags

3 tags

Comments

0 comments »

Implicational Logic Example in Curry

implemented in Curry