Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
46,132
result(s) for
"Computer logic."
Sort by:
Learning from interpretation transition
We propose a novel framework for learning normal logic programs from transitions of interpretations. Given a set of pairs of interpretations (
I
,
J
) such that
J
=
T
P
(
I
), where
T
P
is the immediate consequence operator, we infer the program
P
. The learning framework can be repeatedly applied for identifying Boolean networks from basins of attraction. Two algorithms have been implemented for this learning task, and are compared using examples from the biological literature. We also show how to incorporate background knowledge and inductive biases, then apply the framework to learning transition rules of cellular automata.
Journal Article
Induced betweenness in order-theoretic trees
The ternary relation B(x,y,z) of betweenness states that an element y is between the elements x and z, in some sense depending on the considered structure. In a partially ordered set (N,≤), B(x,y,z):⇔x
Journal Article
Logic Pro X
Spend less time learning and more time recording Logic Pro X offers Mac users the tools and power they need to create recordings ready to share with the world. This book provides the know-how for navigating the interface, tweaking the settings, picking the sounds, and all the other tech tasks that get in the way of capturing the perfect take. Written by a Logic Pro X trainer who's used the software to further his own music career, Logic Pro X For Dummies cuts back on the time needed to learn the software and allows for more time making amazing recordings. Record live sound sources or built-in virtual instruments Arrange your tracks to edit, mix, and master Discover tips to speed the process and record on an iPad Make sense of the latest software updates A favorite among Logic Pro X beginners, this book is updated to reflect the ongoing changes added to enhance Logic Pro X's recording power.
Book
A Type System Describing Unboundedness
We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows to solve the simultaneous-unboundedness problem (SUP) for schemes, which asks, given a set of letters A and a scheme G, whether it is the case that for every number n the scheme accepts a word (a tree) in which every letter from A appears at least n times. Using this type system we prove that SUP is (m-1)-EXPTIME-complete for word-recognizing schemes of order m, and m-EXPTIME-complete for tree-recognizing schemes of order m. Moreover, we establish the reflection property for SUP: out of an input scheme G one can create its enhanced version that recognizes the same language but is aware of the answer to SUP.
Journal Article