Sciweavers

271 search results - page 6 / 55
» Logics from Galois connections
Sort
View
73
Voted
LATA
2010
Springer
15 years 4 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark
79
Voted
LMCS
2006
119views more  LMCS 2006»
14 years 9 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle
94
Voted
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 4 months ago
From IF to BI: a tale of dependence and separation
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
Samson Abramsky, Jouko A. Väänänen
84
Voted
AGI
2008
14 years 11 months ago
How Might Probabilistic Reasoning Emerge from the Brain?
: A series of hypotheses is proposed, connecting neural structures and dynamics with the formal structures and processes of probabilistic logic. First, a hypothetical connection is...
Ben Goertzel, Cassio Pennachin
81
Voted
TPHOL
1996
IEEE
15 years 1 months ago
Importing Mathematics from HOL into Nuprl
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...
Douglas J. Howe