The following pages link to SWI-Prolog (Q2893092):
Displaying 47 items.
- SWI-Prolog (Q32763) (← links)
- Advances in integrative statistics for logic programming (Q324669) (← links)
- Search combinators (Q487659) (← links)
- Hierarchical model-based diagnosis based on structural abstraction (Q814590) (← links)
- Meta-interpretive learning from noisy images (Q1621883) (← links)
- Causal inference in cplint (Q1679666) (← links)
- Information-gain computation in the \textsc{Fifth} system (Q1726365) (← links)
- An SMT-based concolic testing tool for logic programs (Q2039953) (← links)
- Probabilistic inductive constraint logic (Q2051275) (← links)
- Learning hierarchical probabilistic logic programs (Q2071314) (← links)
- \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams (Q2128824) (← links)
- Recursive rules with aggregation: a simple unified semantics (Q2151406) (← links)
- Automated generation of control concepts annotation rules using inductive logic programming. System description (Q2163169) (← links)
- Spatial reasoning about qualitative shape compositions. Composing qualitative lengths and angles (Q2188781) (← links)
- Learning higher-order logic programs (Q2203320) (← links)
- A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575) (← links)
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (Q2363599) (← links)
- Representations for robot knowledge in the \textsc{KnowRob} framework (Q2407430) (← links)
- Learning efficient logic programs (Q2425246) (← links)
- Lifted discriminative learning of probabilistic logic programs (Q2425249) (← links)
- \textsc{Tor}: modular search with hookable disjunction (Q2441515) (← links)
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus (Q2628297) (← links)
- Synthesis of positive logic programs for checking a class of definitions with infinite quantification (Q2629858) (← links)
- Tabling, Rational Terms, and Coinduction Finally Together! (Q2931251) (← links)
- Efficient Low-Level Connection Tableaux (Q3455764) (← links)
- Performing fully parallel constraint logic programming on a quantum annealer (Q4559836) (← links)
- A new algorithm to automate inductive learning of default theories (Q4592724) (← links)
- Concolic testing in logic programming (Q4593010) (← links)
- Logic Programming with Graph Automorphism: Integrating<tt>nauty</tt>with Prolog (Tool Description) (Q4593050) (← links)
- On relation between constraint answer set programming and satisfiability modulo theories (Q4593096) (← links)
- SMCHR: Satisfiability modulo constraint handling rules (Q4911137) (← links)
- Backjumping is Exception Handling (Q4957217) (← links)
- Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms (Q4988930) (← links)
- Optimizing Probabilities in Probabilistic Logic Programs (Q5019596) (← links)
- Planning for an Efficient Implementation of Hypothetical Bousi∼Prolog (Q5019608) (← links)
- (Q5020559) (← links)
- (Q5020560) (← links)
- (Q5020572) (← links)
- Making ProB Compatible with SWI-Prolog (Q5038477) (← links)
- Prolog Technology Reinforcement Learning Prover (Q5049033) (← links)
- Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP (Q5108525) (← links)
- Implementing type theory in higher order constraint logic programming (Q5236551) (← links)
- On Dual Programs in Co-Logic Programming (Q5743583) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Parallel Logic Programming: A Sequel (Q6063892) (← links)
- A Prolog assisted search for new simple Lie algebras (Q6203472) (← links)
