The following pages link to YAP-Prolog (Q19012):
Displaying 42 items.
- Advances in integrative statistics for logic programming (Q324669) (← links)
- kLog: a language for logical and relational learning with kernels (Q464624) (← links)
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs (Q894703) (← links)
- Learning probabilistic logic models from probabilistic examples (Q1009281) (← links)
- Preference Logic Grammars: Fixed point semantics and application to data standardization (Q1603737) (← links)
- Causal inference in cplint (Q1679666) (← links)
- Inductive general game playing (Q2203324) (← links)
- On the use of stochastic local search techniques to revise first-order logic theories from examples (Q2361575) (← links)
- Logic programming. 24th international conference, ICLP 2008, Udine, Italy, December 9--13 2008. Proceedings (Q2377606) (← links)
- \textsc{Tor}: modular search with hookable disjunction (Q2441515) (← links)
- Logic programming. 22nd international conference, ICLP 2006, Seattle, WA, USA, August 17--20, 2006. Proceedings (Q2472268) (← links)
- INDUCTIVE LOGIC PROGRAMMING AS ABDUCTIVE SEARCH (Q2883075) (← links)
- Dedicated tabling for a probabilistic setting (Q2883085) (← links)
- XSB: Extending Prolog with Tabled Logic Programming (Q2893097) (← links)
- Tabling, Rational Terms, and Coinduction Finally Together! (Q2931251) (← links)
- Incremental Tabling in Support of Knowledge Representation and Reasoning (Q2931264) (← links)
- On the implementation of the probabilistic logic programming language ProbLog (Q3008407) (← links)
- On the Implementation of Speculative Constraint Processing (Q3055681) (← links)
- Parallel backtracking with answer memoing for independent and-parallelism (Q3087444) (← links)
- On combining linear-based strategies for tabled evaluation of logic programs (Q3087452) (← links)
- Threads and or-parallelism unified (Q3585157) (← links)
- (Q4499259) (← links)
- Top-down and Bottom-up Evaluation Procedurally Integrated (Q4559824) (← links)
- Table space designs for implicit and explicit concurrent tabled evaluation (Q4559837) (← links)
- Structure learning of probabilistic logic programs by searching the clause space (Q4592977) (← links)
- Tabling as a library with delimited control (Q4592987) (← links)
- On the Implementation of an Or-Parallel Prolog System for Clusters of Multicores (Q4593066) (← links)
- Tabling with Sound Answer Subsumption (Q4593070) (← links)
- (Q4736500) (← links)
- Efficient tabling of structured data with enhanced hash-consing (Q4911133) (← links)
- (Q5020572) (← links)
- Making ProB Compatible with SWI-Prolog (Q5038477) (← links)
- Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP (Q5108525) (← links)
- STUDIES OF THE LOCAL STRUCTURE AND THE g FACTORS FOR THE ORTHORHOMBIC<font>Ti</font><sup>3+</sup>CENTER IN YAP (Q5293776) (← links)
- A practical analysis of non-termination in large logic programs (Q5398306) (← links)
- PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters (Q5431417) (← links)
- Deductive Databases: Implementation, Parallelism and Applications (Q5449648) (← links)
- CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge (Q5452025) (← links)
- Learning Probabilistic Logic Models from Probabilistic Examples (Extended Abstract) (Q5452072) (← links)
- On the Efficient Execution of ProbLog Programs (Q5504655) (← links)
- Towards Typed Prolog (Q5504693) (← links)
