Giter VIP home page Giter VIP logo

vaibhavkarve / graphsat Goto Github PK

View Code? Open in Web Editor NEW
5.0 2.0 2.0 1.68 MB

A python package that recognizes clauses, Cnfs, graphs, hypergraphs, and multi-hypergraphs. The package implements local graph-rewriting, graph-satchecking, calculation of graph disjunctions, as well as checking of new reduction rules.

License: GNU General Public License v3.0

Python 26.31% Makefile 0.11% Jupyter Notebook 63.46% TeX 8.87% Emacs Lisp 0.17% Sage 0.61% Just 0.47%
cnfs graphs graph-theory hyperedges satisfiability reduction-rules hypergraphs multi-hypergraphs clauses graph-disjunctions

graphsat's Introduction

Hi there ๐Ÿ‘‹

You have reached the GitHub page of Vaibhav Karve. He is a Senior Data Scientist at the SimSpace Corporation. He used to be a grad student at the UofI, till he graduated with a PhD in Mathematics in 2021. You can get more information (on publications, CV, teaching, talks, and random projects) by visiting his website at vaibhavkarve.github.io.

Technologies โšก

  • Python, Lean theorem prover, SageMath, Octave, Coq, Haskell, ELisp, bash, make
  • LaTeX, plain TeX, CoCalc, XPPaut, Docker, Emacs, git, GitHub/GitLab
  • Computational graph theory, Data science, Mathematical modelling, High-dimensional data, Machine learning and neural networks, Formal verification, Computational complexity, Algorithms
  • Currently learning: Julia, Scheme

graphsat's People

Contributors

vaibhavkarve avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

graphsat's Issues

Create docker image for testing pip package

When we create a pip-installable package and put it on PyPI, we should
have a way to test our installation steps.

Possible installation steps

  • pip install graphsat (from pip and without poetry)
  • install Minisat22
  • run the test suite of graphsat (will need to include tests as part of the package)

Docker recommendations

  • use alpine-linux for a slimmer image
  • cache the pip installation for faster testing time

Construct the following graph-satchecker

Take a graph. Compute all Cnfs on it. Translate each CNF by the correct
amount so that each CNF has a disjoint variable set. Then send this
big-bloated CNF to a cnf-satchecker.

Question: Is this strategy faster than other graph-satcheckers?

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.