The YAP prolog system
From MaRDI portal
Recommendations
Cites work
- An Introduction to Language Processing with Perl and Prolog
- CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge
- Concepts, design, and performance analysis of a parallel prolog machine
- Depth-First Search and Linear Graph Algorithms
- Efficient access mechanisms for tabled logic programs
- Markov logic networks
- On applying or-parallelism and tabling to logic programs
- The Vienna abstract machine
Cited in
(28)- Causal inference in cplint
- YAP-Prolog
- Inductive general game playing
- On the use of stochastic local search techniques to revise first-order logic theories from examples
- \textsc{Tor}: modular search with hookable disjunction
- Tabling, rational terms, and coinduction finally together!
- Incremental Tabling in Support of Knowledge Representation and Reasoning
- Advances in integrative statistics for logic programming
- CHR for Imperative Host Languages
- scientific article; zbMATH DE number 4123326 (Why is no real title available?)
- Top-down and bottom-up evaluation procedurally integrated
- Table space designs for implicit and explicit concurrent tabled evaluation
- Structure learning of probabilistic logic programs by searching the clause space
- Tabling as a library with delimited control
- On the implementation of an or-parallel Prolog system for clusters of multicores
- Tabling with sound answer subsumption
- kLog: a language for logical and relational learning with kernels
- Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms
- scientific article; zbMATH DE number 7453126 (Why is no real title available?)
- Making ProB Compatible with SWI-Prolog
- Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP*
- A practical analysis of non-termination in large logic programs
- Fifty Years of Prolog and Beyond
- Parallel Logic Programming: A Sequel
- Disjunctive delimited control
- Typed SLD-resolution: dynamic typing for logic programming
- Defeasible reasoning via \(\mathrm{Datalog} {}^\neg\)
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs
This page was built for publication: The YAP prolog system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893087)
