Results 101 to 110 of about 201,128 (321)

Regularization in Probabilistic Inductive Logic Programming

open access: yes, 2023
AbstractProbabilistic Logic Programming combines uncertainty and logic-based languages. Liftable Probabilistic Logic Programs have been recently proposed to perform inference in a lifted way. LIFTCOVER is an algorithm used to perform parameter and structure learning of liftable probabilistic logic programs. In particular, it performs parameter learning
Elisabetta Gentili   +4 more
openaire   +1 more source

kLog: A Language for Logical and Relational Learning with Kernels

open access: yes, 2014
We introduce kLog, a novel approach to statistical relational learning. Unlike standard approaches, kLog does not represent a probability distribution directly. It is rather a language to perform kernel-based learning on expressive logical and relational
Altun   +92 more
core   +1 more source

“Lives and times”: The case for qualitative longitudinal research in anatomical sciences education

open access: yesAnatomical Sciences Education, EarlyView.
Abstract Qualitative longitudinal research (QLR) focuses on changes in perceptions, interpretations, or practices through time. Despite longstanding traditions in social science, QLR has only recently appeared in anatomical sciences education (ASE).
Charlotte E. Rees, Ella Ottrey
wiley   +1 more source

Homology Induction: the use of machine learning to improve sequence similarity searches

open access: yesBMC Bioinformatics, 2002
Background The inference of homology between proteins is a key problem in molecular biology The current best approaches only identify ~50% of homologies (with a false positive rate set at 1/1000).
King Ross D, Karwath Andreas
doaj   +1 more source

Induction of constraint logic programs [PDF]

open access: yes, 1998
Inductive Logic Programming (ILP) is concerned with learning hypotheses from examples, where both examples and hypotheses are represented in the Logic Programming (LP) language. The application of ILP to problems involving numerical information has shown the need for basic numerical background knowledge (e.g. relation “less than”).
Michèle Sebag   +2 more
openaire   +2 more sources

Semantic primitives and compositionality: An Annual Review of Information Science and Technology (ARIST) paper

open access: yesJournal of the Association for Information Science and Technology, EarlyView.
Abstract The term semantic primitives refers to a set of basic, atomic concepts from which all other (compound) concepts are constructed. It presupposes the principle of compositionality—the idea that complex items or expressions can be formed by combining simpler constituents.
Birger Hjørland
wiley   +1 more source

Formal Analysis of Security Models for Mobile Devices, Virtualization Platforms, and Domain Name Systems

open access: yesCLEI Electronic Journal, 2015
In this work we investigate the security of security-critical applications, i.e. applications in which a failure may produce consequences that are unacceptable.
Gustavo Betarte, Carlos Luna
doaj   +1 more source

NiFe‐NO3 Layered Double Hydroxide as a Novel Anode for Sodium Ion Batteries

open access: yesBatteries &Supercaps, Volume 8, Issue 3, March 2025.
This study demonstrates, for the first time, the effectiveness of using LDH as an anodic material in SIB. The material is stable and show high specific capacity, the reaction mechanism has been thoroughly investigated and comprehensively described and involves a phase change reaction followed by sodium intercalation.
Marco Fortunato   +4 more
wiley   +1 more source

Predicting functional upstream open reading frames in Saccharomyces cerevisiae

open access: yesBMC Bioinformatics, 2009
Background Some upstream open reading frames (uORFs) regulate gene expression (i.e., they are functional) and can play key roles in keeping organisms healthy. However, how uORFs are involved in gene regulation is not yet fully understood. In order to get
Kristiansson Erik   +5 more
doaj   +1 more source

Quantitative Models and Implicit Complexity

open access: yes, 2005
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Elementary Affine Logic, LFPL (a language for polytime computation close to realistic functional programming introduced by one of us ...
A. Asperti   +9 more
core   +4 more sources

Home - About - Disclaimer - Privacy