SWI-Prolog
From MaRDI portal
Publication:2893092
DOI10.1017/S1471068411000494zbMath1244.68023arXiv1011.5332OpenAlexW2911601159MaRDI QIDQ2893092
Tom Schrijvers, Markus Triska, Torbjörn Lager, Jan Wielemaker
Publication date: 25 June 2012
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.5332
Related Items (48)
Making ProB Compatible with SWI-Prolog ⋮ Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form ⋮ Meta-interpretive learning from noisy images ⋮ \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams ⋮ Prolog Technology Reinforcement Learning Prover ⋮ On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ Synthesis of positive logic programs for checking a class of definitions with infinite quantification ⋮ Efficient Low-Level Connection Tableaux ⋮ Advances in integrative statistics for logic programming ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ Performing fully parallel constraint logic programming on a quantum annealer ⋮ Automated generation of control concepts annotation rules using inductive logic programming. System description ⋮ Tabling, Rational Terms, and Coinduction Finally Together! ⋮ Representations for robot knowledge in the \textsc{KnowRob} framework ⋮ Causal inference in cplint ⋮ Spatial reasoning about qualitative shape compositions. Composing qualitative lengths and angles ⋮ Fifty Years of Prolog and Beyond ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Parallel Logic Programming: A Sequel ⋮ A new algorithm to automate inductive learning of default theories ⋮ Concolic testing in logic programming ⋮ Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description) ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP ⋮ Learning efficient logic programs ⋮ Lifted discriminative learning of probabilistic logic programs ⋮ A Prolog assisted search for new simple Lie algebras ⋮ Learning higher-order logic programs ⋮ \textsc{Tor}: modular search with hookable disjunction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Information-gain computation in the \textsc{Fifth} system ⋮ Search combinators ⋮ SMCHR: Satisfiability modulo constraint handling rules ⋮ On Dual Programs in Co-Logic Programming ⋮ Backjumping is Exception Handling ⋮ An SMT-based concolic testing tool for logic programs ⋮ A subdivision algorithm to reason on high-degree polynomial constraints over finite domains ⋮ Probabilistic inductive constraint logic ⋮ SWI-Prolog ⋮ Learning hierarchical probabilistic logic programs ⋮ Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms ⋮ Implementing type theory in higher order constraint logic programming ⋮ Optimizing Probabilities in Probabilistic Logic Programs ⋮ Planning for an Efficient Implementation of Hypothetical Bousi∼Prolog ⋮ Hierarchical model-based diagnosis based on structural abstraction
Cites Work
This page was built for publication: SWI-Prolog
