Based on a recently proposed framework of learning from constraints using kernel-based representations, in this brief, we naturally extend its application to the case of inferences on new constraints. We give examples for polynomials and first-order logic by showing how new constraints can be checked on the basis of given premises and data samples. Interestingly, this gives rise to a perceptual logic scheme in which the inference mechanisms do not rely only on formal schemes, but also on the data probability distribution. It is claimed that when using a properly relaxed computational checking approach, the complementary role of data samples makes it possible to break the complexity barriers of related formal checking mechanisms.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||Constraint Verification With Kernel Machines|
|Rivista:||IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS|
|Citazione:||Gori, M., & Melacci, S. (2013). Constraint Verification With Kernel Machines. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 24(5), 825-831.|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: