Did you know ...
Search Documentation:
Predicate taut/2
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
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
library
clp
bounds.pl -- Simple integer solver that keeps track of upper and lower bounds
clp_events.pl
clpb.pl -- CLP(B): Constraint Logic Programming over Boolean Variables
sat/1
taut/2
labeling/1
sat_count/2
random_labeling/2
weighted_maximum/3
clpfd.pl -- CLP(FD): Constraint Logic Programming over Finite Domains
simplex.pl -- Solve linear programming problems
taut
(+Expr, -T)
is
semidet
Tautology check. Succeeds with
T
= 0 if the Boolean expression
Expr
cannot be satisfied, and with
T
= 1 if
Expr
is always true with respect to the current constraints. Fails otherwise.