B-Prolog is a high-performance implementation of the standard Prolog language with several extended features including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loops, and tabling. Read more on Wiki.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Schrijvers, Tom; Demoen, Bart; Triska, Markus; Desouter, Benoit: Tor: modular search with hookable disjunction (2014)
- Demoen, Bart; Garcia de la Banda, Maria: Redundant disequalities in the Latin square problem (2013)
- Schrijvers, Tom; Tack, Guido; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J.: An introduction to search combinators (2013)
- Schrijvers, Tom; Tack, Guido; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J.: Search combinators (2013)
- Zhou, Neng-Fa: The language features and architecture of B-Prolog (2012)
- Zhou, Neng-Fa; Have, Christian Theil: Efficient tabling of structured data with enhanced hash-consing (2012)
- Cattafi, Massimiliano; Gavanelli, Marco; Nonato, Maddalena; Alvisi, Stefano; Franchini, Marco: Optimal placement of valves in a water distribution network with $CLP(FD)$ (2011)
- Riguzzi, Fabrizio; Swift, Terrance: The PITA system: tabling and answer subsumption for reasoning under uncertainty (2011)