We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...