The language features and architecture of B-Prolog

DOI10.1017/S1471068411000445zbMath1244.68024OpenAlexW2963711700MaRDI QIDQ2893099

Neng-Fa Zhou

Publication date: 25 June 2012

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068411000445

zbMATH Keywords

Prologlogic programming system

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17)

Related Items (12)

Top-down and Bottom-up Evaluation Procedurally Integrated ⋮ Table space designs for implicit and explicit concurrent tabled evaluation ⋮ Fifty Years of Prolog and Beyond ⋮ Parallel Logic Programming: A Sequel ⋮ 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 ⋮ \textsc{Tor}: modular search with hookable disjunction ⋮ Search combinators ⋮ A practical analysis of non-termination in large logic programs ⋮ Redundant disequalities in the Latin square problem

Uses Software

• B-Prolog

Cites Work

• Unnamed Item
• Efficient access mechanisms for tabled logic programs
• 1983–1993: The wonder years of sequential Prolog implementation
• Tabled evaluation with delaying for general logic programs
• Linear tabling strategies and optimizations
• Programming finite-domain constraint propagators in Action Rules

This page was built for publication: The language features and architecture of B-Prolog