satisfy

Examples of satisfiable

satisfiable
By the satisfaction relation described above, any satisfiable disjunction free description corresponds to an equivalence class of mutually alphabetic variant feature structures.
The first one ensures that states remain satisfiable along any resolution.
A constraint in solved form has the property that it is clear whether it is satisfiable or not.
If c is not satisfiable, we disregard this rule.
Nodes containing only a satisfiable set of equality atoms and non-grounded negative literals are said to be floundered and have no children.
However, the test suites are automatically generated, and the authors do not discuss whether these rules could have been coded in an alternatively satisfiable way.
A proposition with an empty constraint is not satisfiable.
These constraints are not both satisfiable in the consequent, under the semantics of application.
What is required is to indicate the constraints that they must satisfy and to give some reason for thinking that these might be satisfiable.
When is taken to be the complete relation, this premise is always satisfiable.
By the semantics of negation and conjunction, we infer s=a ()tt ()tt, but the latter formula is clearly not satisfiable in labelled transition systems.
We say that a predicate is satisfiable if some closed substitution satisfies it.
We want to know whether it is satisfiable or universally satisfied.
To determine which rules are satisfiable and testable, it is necessary to figure out which predicates are satisfiable and testable, respectively.
We have the following useful result regarding 'rt' and satisfiable substitutions that are equivalent with respect to any given syntactic equality theory.
These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors.