Cited in
(41)- \textsc{Tor}: modular search with hookable disjunction
- The language features and architecture of B-Prolog
- Redundant disequalities in the Latin square problem
- On relation between constraint answer set programming and satisfiability modulo theories
- Model generation with Boolean constraints
- Tabling with sound answer subsumption
- Integrating finite domain and set constraints into a set-based constraint language
- CLPS-B
- DLV-EX
- TSPTW
- clpfd
- JaCoP
- Prolog
- Cardinal
- PITA
- YAP-Prolog
- Zinc
- SICStus
- CAT
- OPTYap
- XSB
- GHC
- SWI-Prolog
- IDP
- PARLOG
- LPaaS
- JSetL
- anthem
- 2P-Kt
- tuProlog
- TuCSoN
- TuSoW
- Constraint answer set solver EZCSP and why integration schemas matter
- Optimal placement of valves in a water distribution network with CLP(FD)
- Tabling as a library with delimited control
- Search combinators
- Efficient tabling of structured data with enhanced hash-consing
- Table space designs for implicit and explicit concurrent tabled evaluation
- Top-down and bottom-up evaluation procedurally integrated
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- An introduction to search combinators
This page was built for software: B-Prolog
