On a Convex Logic Fragment for Learning and Reasoning
- 5 November 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 27 (7) , 1407-1416
Abstract
In this paper we introduce the convex fragment of Lukasiewicz Logic and discuss its possible applications in different learning schemes. Indeed, the provided theoretical results are highly general, because they can be exploited in any learning framework involving logical constraints. The method is of particular interest since the fragment guarantees to deal with convex constraints, which are shown to be equivalent to a set of linear constraints. Within this framework, we are able to formulate learning with kernel machines as well as collective classification as a quadratic programming problem.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Bridging logic and kernel machinesMachine Learning, 2011
- Fast learning of relational kernelsMachine Learning, 2010
- Probabilistic Inductive Logic Programming2008
- Markov logic networksMachine Learning, 2006
- Probabilistic logic learningACM SIGKDD Explorations Newsletter, 2003
- Residuated fuzzy logics with an involutive negationArchive for Mathematical Logic, 2000
- Support-vector networksMachine Learning, 1995
- Inductive Logic Programming: Theory and methodsThe Journal of Logic Programming, 1994
- A scaled conjugate gradient algorithm for fast supervised learningNeural Networks, 1993
- Inductive logic programmingNew Generation Computing, 1991