The YAP Prolog system

From MaRDI portal
Publication:2893087

DOI10.1017/S1471068411000512zbMath1244.68017OpenAlexW1984187667MaRDI QIDQ2893087

Vitor Costa, Ricardo Rocha, Luís Damas

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/s1471068411000512




Related Items (26)

On the use of stochastic local search techniques to revise first-order logic theories from examplesMaking ProB Compatible with SWI-PrologAdvances in integrative statistics for logic programmingTop-down and Bottom-up Evaluation Procedurally IntegratedTable space designs for implicit and explicit concurrent tabled evaluationTabling, Rational Terms, and Coinduction Finally Together!Incremental Tabling in Support of Knowledge Representation and ReasoningCausal inference in cplintFifty Years of Prolog and BeyondParallel Logic Programming: A SequelStructure learning of probabilistic logic programs by searching the clause spaceTabling as a library with delimited controlOn the Implementation of an Or-Parallel Prolog System for Clusters of MulticoresTabling with Sound Answer SubsumptionBandit-based Monte-Carlo structure learning of probabilistic logic programsDisjunctive delimited controlTyped SLD-resolution: dynamic typing for logic programmingEvaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLPInductive general game playing\textsc{Tor}: modular search with hookable disjunctionUnnamed ItemkLog: a language for logical and relational learning with kernelsA practical analysis of non-termination in large logic programsCHR for Imperative Host LanguagesYAP-PrologDeriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms


Uses Software


Cites Work




This page was built for publication: The YAP Prolog system