In the search by formula, you input a formula which is a conjunction of properties and their negations and it outputs a list of spaces satisfying the search.
Would it be not too hard to implement a reverse search, where you input a conjunction of spaces and their negations and it outputs a list of properties which are satisfied by all the spaces and not satisfied by all the negated spaces
it's the same thing but reversing the role of space and property, since "space S has property P" is symmetric with "property P is satisfied by space S"
In the search by formula, you input a formula which is a conjunction of properties and their negations and it outputs a list of spaces satisfying the search.
Would it be not too hard to implement a reverse search, where you input a conjunction of spaces and their negations and it outputs a list of properties which are satisfied by all the spaces and not satisfied by all the negated spaces
it's the same thing but reversing the role of space and property, since "space S has property P" is symmetric with "property P is satisfied by space S"