search

bakaq / constrained.pl

Provides generalized versions of common Prolog predicates using constraints to make them more flexible and declarative.
The Unlicense
8 stars 2 forks source link

Automated search of inconsistency #9

Closed bakaq closed 1 year ago

bakaq commented 1 year ago

I want to create a program that systematically searches for queries of the form:

Term = <some term>,
Functor = <some term>,
Arity = <some term>,
functor(Term, Functor, Arity).

That terminate and succeed. Then test that the following queries also terminate and succeed:

functor_spec(Term, Functor, Arity),
% Every permutation of the following goals
Term = <some term>,
Functor = <some term>,
Arity = <some term>.

And similarly for the other predicates provided here. Maybe then generalize for multiple calls to the predicate being tested, in different permutations, and to mixing different predicates together.