Effectively Propositional Logic (EPR), also known as the Bernays-Schoenfinkel class, allows encoding problems that are propositional in nature, but EPR encodings can be exponentially more succinct ...

Automated theorem prover for propositional logic which uses sequent calculus. Written in MAXIMA. As a research assistant in Tampere University I was tasked with creating moodle exercises using the ...

The PLRE (propositional logic reasoning engine) is a Python package for determining the truth values of propositional logic formulae, given an assignment of truth values to the propositional symbols ...

Abstract: We study partiality in propositional logics containing formulas with either undefined or over-defined truth-values. Undefined values are created by adding a four-place connective W termed ...

We consider extending the modal logic KD45, commonly taken as the baseline system for belief, with propositional quantifiers that can be used to formalize natural language sentences such as ...

Abstract: Workflow verification has been a well studied research topic during the past few years. Theorem proof based approaches to workflow verification become popular due to several advantages ...

This is a preview. Log in through your library . Abstract Deductive inference is usually regarded as being "tautological" or "analytical": the information conveyed by the conclusion is contained in ...