(in)/2

Did you know ...

Search Documentation:

Predicate in/2

HOME
DOWNLOAD
DOCUMENTATION
- Manual
- Packages
- FAQ
- Command line
- PlDoc
- Bluffers▶
- License
- Publications
- Rev 7 Extensions
TUTORIALS
- Beginner▶
- Advanced▶
- Web applications▶
- Semantic web▶
  - ClioPatria
  - RDF namespaces
- Graphics▶
  - XPCE
  - GUI options
- Machine learning▶
  - Probabilistic Logic Programming
- External collections▶
  - Meta level tutorials
- For packagers▶
  - Linux packages
COMMUNITY
COMMERCIAL
WIKI
- Login
- View changes
- Sandbox
- Wiki help
- All tags

Documentation
- Reference manual
  - The SWI-Prolog library
    - library(clpfd): CLP(FD): Constraint Logic Programming over Finite Domains
      - CLP(FD) predicate index
        
        Membership constraints
        
        in/2
        
        ins/2
- Packages

Availability::- use_module(library(clpfd)).

Source

?Var in +Domain

Var is an element of Domain. Domain is one of:

Integer: Singleton set consisting only of Integer.
Lower .. Upper: All integers I such that Lower =< I =< Upper. Lower must be an integer or the atom inf, which denotes negative infinity. Upper must be an integer or the atom sup, which denotes positive infinity.
Domain1 \/ Domain2: The union of Domain1 and Domain2.

Availability::- use_module(library(tipc/tipc_linda)).

Source

[det]in(+TupleList, -Tuple)

As in/1 but succeeds when any one of the tuples in TupleList is available. Tuple is unified with the fetched tuple.