PLMan - Propositional Logic Parser

Brought to you by: delta88

Last Update: 2013-02-27

Get an email when there's a new version of PLMan - Propositional Logic Parser

PLMan is a propositional logic sentence parser/calculator with variable
handling capability implemented in Java, which means that it runs on every JVM
installed environment (Unix, Linux, Windows, etc.).

Project Activity

See All Activity >

Follow PLMan - Propositional Logic Parser

PLMan - Propositional Logic Parser Web Site

Other Useful Business Software

Go from Code to Production URL in Seconds

Cloud Run deploys apps in any language instantly. Scales to zero. Pay only when code runs.

Skip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.

Try it free

Rate This Project

User Reviews

Be the first to post a review of PLMan - Propositional Logic Parser!

Additional Project Details

Registered

2003-12-19

Report inappropriate content

Ship Agents Faster

Transform your applications and workflows into powerful agentic systems at global scale.

Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.

Get Started Free

Recommended Projects

Logic Calculator
A Calculator to perform logical operations
INI Parser Library
An INI file parser that can read, edit and create large INI files. Usable under Microsoft Windows, DOS, Linux, etc. Supported languages are C, C++, Visual Basic, Java, TCL, Perl, Python, etc (DLL and SWIG capable).
qanagram
This GUI application generates an anagram, which means rearranging the letters of a word to obtain other words. The application is written in C++ with Qt-4, which means it runs on Unix and also Windows and Mac.
Logic Custom OS
A students experimental command driven OS
tydevi
Typed Dependency Viewer. Provides a view of typed dependencies of a sentence as computed by Stanford parser