The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.

Project Activity

See All Activity >

License

GNU General Public License version 2.0 (GPLv2)

Follow PL-PSF

PL-PSF Web Site

Other Useful Business Software
Our Free Plans just got better! | Auth0 Icon
Our Free Plans just got better! | Auth0

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of PL-PSF!

Additional Project Details

Intended Audience

Science/Research, Developers

User Interface

.NET/Mono

Programming Language

C#

Related Categories

C# Artificial Intelligence Software

Registered

2007-03-10