Skip to content

asntr/propositional-logic-parser

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Descrption

The input should be a propositional formula in the usual notation: using variables, logical constants 0 and 1, and connectives /, /, ->, <->, and ~. (For example, "(p / ~q) <-> r").

The programme doing the following:

1. Translating the formula into conjunctive normal form (and prints it out
in a human-readable way).

2. Using the resolution method, checking whether the formula is
satisfiable. (Answer "yes"/"no")

Launching

python __main__.py [--debug]

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages