Substructural logic is logic without some or all of the structural rules. Is substructural Prolog, substructural logic programming possible? My question is connected with article https://link.springer.com/chapter/10.1007/3-540-40030-3_8 Grammar Induction as Substructural Inductive Logic Programming - if substructural Prolog is possible then one can implement substructural inductive logic programming in it (e.g. http://ilasp.com/ for the answer set version of ILP over Prolog in the non-substructural setting) and apply, e.g. in grammar induction case.

How hard the usual (e.g. SWI) Prolog should be remade to be used as substructural Prolog?

  • 1
    $\begingroup$ lix.polytechnique.fr/~dale/lolli $\endgroup$
    – Dan Doel
    Jul 19, 2019 at 1:05
  • $\begingroup$ @DanDoel: do you know of an ordered one, like what Jeff Polakow did in his thesis? Surely someone at CMU must have implemented something. $\endgroup$ Jul 19, 2019 at 11:59
  • $\begingroup$ I'm afraid I don't know of anything like that, but I'm far from an expert in this area. $\endgroup$
    – Dan Doel
    Jul 20, 2019 at 13:46

1 Answer 1


Logic programming with substructural logics has been studied, starting in the second half of the 90's. I am not an expert, but I can probably provide enough references to get you going.

There is Dale Miller's Lolli, a programming language for linear logic programming.

Major research was carried out by Frank Pfenning and his coworkers and students. For example:

I am pretty sure someone implemented logic programming for ordered linear logic, poke around the work done by Jeff Polakow and Frank Pfenning. I don't seem to be able to find it right now.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.