The language features and architecture of B-Prolog
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 53637
- scientific article; zbMATH DE number 193950
- The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines
- Global Optimizations in a Prolog Compiler for the Toam
- Design and analysis of hardware for high-performance prolog
Cites work
- 1983–1993: The wonder years of sequential Prolog implementation
- Efficient access mechanisms for tabled logic programs
- scientific article; zbMATH DE number 192840 (Why is no real title available?)
- Linear tabling strategies and optimizations
- Programming finite-domain constraint propagators in Action Rules
- Tabled evaluation with delaying for general logic programs
Cited in
(16)- Redundant disequalities in the Latin square problem
- \textsc{Tor}: modular search with hookable disjunction
- scientific article; zbMATH DE number 53637 (Why is no real title available?)
- Top-down and bottom-up evaluation procedurally integrated
- Table space designs for implicit and explicit concurrent tabled evaluation
- Tabling as a library with delimited control
- Tabling with sound answer subsumption
- Constraint answer set solver EZCSP and why integration schemas matter
- On relation between constraint answer set programming and satisfiability modulo theories
- Global Optimizations in a Prolog Compiler for the Toam
- Search combinators
- A practical analysis of non-termination in large logic programs
- Two WAM Implementations of Action Rules
- Fifty Years of Prolog and Beyond
- Parallel Logic Programming: A Sequel
- Constraint answer set programming: integrational and translational (or SMT-based) approaches
This page was built for publication: The language features and architecture of B-Prolog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893099)
