Results 11 to 20 of about 29,176 (93)
BioMake: a GNU make-compatible utility for declarative workflow management. [PDF]
Bioinformatics, 2017 Holmes IH, Mungall CJ.
europepmc +2 more sources
Interactive Simplifier Tracing and Debugging in Isabelle [PDF]
, 2014 The Isabelle proof assistant comes equipped with a very powerful tactic for term simplification. While tremendously useful, the results of simplifying a term do not always match the user's expectation: sometimes, the resulting term is not in the form the
D. Aspinall +7 more
core +1 more source
Towards constraint-informed information systems
Research Challenges in Information Science, 2013 Declarative techniques such as Constraint Programming are very useful in modeling complex requirements. They have the added benefit of being executable specifications and, when properly tuned, high-performance ones.
I. Rodrigues +4 more
semanticscholar +1 more source
Lock-free atom garbage collection for multithreaded Prolog [PDF]
, 2016 The runtime system of dynamic languages such as Prolog or Lisp and their derivatives contain a symbol table, in Prolog often called the atom table. A simple dynamically resizing hash-table used to be an adequate way to implement this table.
Harris, Keri, Wielemaker, Jan
core +4 more sources
TOR: modular search with hookable disjunction [PDF]
, 2014 Horn Clause Programs have a natural exhaustive depth-first procedural semantics. However, for many programs this semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the ...
Demoen, Bart +3 more
core +1 more source
Automatically Mining Program Build Information via Signature Matching
, 2013 Program build information, such as compilers and libraries used, is vitally important in an auditing and benchmarking framework for HPC systems. We have developed a tool to automatically extract this information using signature-based detection, a common ...
Lu, Charng-Da
core +1 more source
The Grid[Way] Job Template Manager, a tool for parameter sweeping [PDF]
, 2010 Parameter sweeping is a widely used algorithmic technique in computational science. It is specially suited for high-throughput computing since the jobs evaluating the parameter space are loosely coupled or independent.
Huedo, Eduardo +2 more
core +1 more source
The Ciao clp(FD) library. A modular CLP extension for Prolog [PDF]
, 2013 We present a new free library for Constraint Logic Programming over Finite Domains, included with the Ciao Prolog system. The library is entirely written in Prolog, leveraging on Ciao's module system and code transformation capabilities in order to ...
Gallego Arias, Emilio Jesús +3 more
core +2 more sources
Uma nova abordagem para diagnóstico de doenças via web. [PDF]
, 2020 RESUMO: Neste trabalho é apresentada e discutida a nova plataforma do módulo de diagnóstico de doenças (módulo produtor) do sistema Diagnose Virtual que foi desenvolvida para integrar ao portal WebAgritec.
LIMA, H. P. de, MASSRUHA, S. M. F. S.
core
Finite domain constraint programming systems [PDF]
, 2002 Tutorial at CP'2002, Principles and Practice of Constraint Programming. Powerpoint slides.
Carlsson, Mats, Schulte, Christian
core +1 more source