https://github.com/pthariensflame/satnqclause

Truffle implementation of a recursive open-world solver for nested quantifier clauses
https://github.com/pthariensflame/satnqclause

logic-programming truffle-framework

Last synced: 10 months ago
JSON representation

Truffle implementation of a recursive open-world solver for nested quantifier clauses

• Host: GitHub
• URL: https://github.com/pthariensflame/satnqclause
• Owner: pthariensflame
• License: bsd-3-clause
• Created: 2020-05-23T19:37:21.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2020-05-25T04:29:24.000Z (about 6 years ago)
• Last Synced: 2025-03-24T20:07:45.863Z (over 1 year ago)
• Topics: logic-programming, truffle-framework
• Language: Java
• Size: 40 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# SatNQClause

**Heavily WIP.**  Truffle implementation of an open-world solver for [hereditary Harrop formulae](https://en.wikipedia.org/wiki/Harrop_formula#Hereditary_Harrop_formulae_and_logic_programming) over [dependenly-sorted algebras with isomorphism](https://arxiv.org/abs/1603.03092); for use internally in [Sylvia](https://github.com/pthariensflame/sylvia) (and possibly other places in the future) and inspired by [chalk](https://github.com/rust-lang/chalk).  The name is a pun on [“Santa Claus”](https://en.wikipedia.org/wiki/Santa_Claus), and is short for “Satisfiability of Nested Quantifier Clauses".