{}/1

Documentation
- Reference manual
  - The SWI-Prolog library
    - library(clpqr): Constraint Logic Programming over Rationals and Reals
      - Solver predicates
        
        {}/1
        
        entailed/1
        
        inf/2
        
        sup/2
        
        minimize/1
        
        maximize/1
        
        bb_inf/5
        
        bb_inf/4
        
        bb_inf/3
        
        dump/3
- Packages

Availability::- use_module(library(clpq/nf_q)).

{}(+Constraints)

Adds the constraints given by Constraints to the constraint store.

Availability::- use_module(library(semweb/rdf11)).

[semidet]{}(+Where)

[semidet]rdf_where(+Where)

Formulate constraints on RDF terms, notably literals. These are intended to be used as illustrated below. RDF constraints are pure: they may be placed before, after or inside a graph pattern and, provided the code contains no commit operations (!, ->), the semantics of the goal remains the same. Preferably, constraints are placed before the graph pattern as they often help the RDF database to exploit its literal indexes. In the example below, the database can choose between using the subject and/or predicate hash or the ordered literal table.

    { Date >= "2000-01-01"^^xsd:date },
    rdf(S, P, Date)

The following constraints are currently defined:

> , >=,==,=<,<: The comparison operators are defined between numbers (of any recognised type), typed literals of the same type and langStrings of the same language.
prefix(String, Pattern)
substring(String, Pattern)
word(String, Pattern)
like(String, Pattern)
icase(String, Pattern): Text matching operators that act on both typed literals and langStrings.
lang_matches(Term, Pattern): Demands a full RDF term (Text@Lang) or a plain Lang term to match the language pattern Pattern.

The predicates rdf_where/1 and {}/1 are identical. The rdf_where/1 variant is provided to avoid ambiguity in applications where {}/1 is used for other purposes. Note that it is also possible to write rdf11:{...}.