Did you know ...
Search Documentation:
bounds.pl -- Simple integer solver that keeps track of upper and lower bounds
HOME
DOWNLOAD
SWI-Prolog
Sources/building
Docker images
Add-ons
Browse GIT
DOCUMENTATION
Manual
Packages
FAQ
Command line
PlDoc
Bluffers
▶
Prolog syntax
PceEmacs
HTML generation
License
Publications
Rev 7 Extensions
TUTORIALS
Beginner
▶
Getting started
Learn Prolog Now!
Simply Logical
Debugger
Development tools
Advanced
▶
Modules
Grammars (DCGs)
clp(fd)
Printing messages
PlDoc
Web applications
▶
Web applications
Let's Encrypt!
Pengines
Semantic web
▶
ClioPatria
RDF namespaces
Graphics
▶
XPCE
GUI options
Machine learning
▶
Probabilistic Logic Programming
External collections
▶
Meta level tutorials
For packagers
▶
Linux packages
COMMUNITY
IRC
Forum & mailing list
Blog
News
Report a bug
Submit a patch
Submit an add-on
Roadmap (on GitHub)
External links
Contributing
Code of Conduct
Contributors
SWI-Prolog items
COMMERCIAL
WIKI
Login
View changes
Sandbox
Wiki help
All tags
author
- Tom Schrijvers
deprecated
- No longer maintained. Please use
clpfd.pl
Undocumented predicates
The following predicates are exported, but not or incorrectly documented.
Arg1
#>=
Arg2
Arg1
#<
Arg2
Arg1
#>
Arg2
label
(Arg1)
all_different
(Arg1)
Arg1
in
Arg2
check
(Arg1)
lex_chain
(Arg1)
indomain
(Arg1)
sum
(Arg1, Arg2, Arg3)
tuples_in
(Arg1, Arg2)
serialized
(Arg1, Arg2)
#\
Arg1
labeling
(Arg1, Arg2)
Arg1
#\
Arg2
Arg1
#\/
Arg2
Arg1
#/\
Arg2
Arg1
#<=
Arg2
Arg1
#=>
Arg2
Arg1
#<=>
Arg2
Arg1
#\=
Arg2
Arg1
#=
Arg2
Arg1
#=<
Arg2