Online learning of event definitions
Systems for symbolic event recognition infer occurrences of events in time using a set of
event definitions in the form of first-order rules. The Event Calculus is a temporal logic that …
event definitions in the form of first-order rules. The Event Calculus is a temporal logic that …
The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
A Tamaddoni-Nezhad, S Muggleton - Machine learning, 2009 - Springer
Searching the hypothesis space bounded below by a bottom clause is the basis of several
state-of-the-art ILP systems (eg Progol, Aleph). These systems use refinement operators …
state-of-the-art ILP systems (eg Progol, Aleph). These systems use refinement operators …
Online structure learning for markov logic networks
Most existing learning methods for Markov Logic Networks (MLNs) use batch training, which
becomes computationally expensive and eventually infeasible for large datasets with …
becomes computationally expensive and eventually infeasible for large datasets with …
Chess revision: Acquiring the rules of chess variants through FOL theory revision from examples
The game of chess has been a major testbed for research in artificial intelligence, since it
requires focus on intelligent reasoning. Particularly, several challenges arise to machine …
requires focus on intelligent reasoning. Particularly, several challenges arise to machine …
Using the bottom clause and mode declarations in FOL theory revision from examples
AL Duboc, A Paes, G Zaverucha - Machine learning, 2009 - Springer
Abstract Theory revision systems are designed to improve the accuracy of an initial theory,
producing more accurate and comprehensible theories than purely inductive methods. Such …
producing more accurate and comprehensible theories than purely inductive methods. Such …
[图书][B] Logic-based machine learning using a bounded hypothesis space: the lattice structure, refinement operators and a genetic algorithm approach
AT Nezhad - 2014 - core.ac.uk
Rich representation inherited from computational logic makes logic-based machine learning
a competent method for application domains involving relational background knowledge …
a competent method for application domains involving relational background knowledge …
[PDF][PDF] Discriminative learning with markov logic networks
TN Huynh - 2009 - cs.utexas.edu
Statistical relational learning (SRL) is an emerging area of research that addresses the
problem of learning from noisy structured/relational data. Markov logic networks (MLNs) …
problem of learning from noisy structured/relational data. Markov logic networks (MLNs) …
[图书][B] Learning with Markov logic networks: transfer learning, structure learning, and an application to Web query disambiguation
LS Mihalkova - 2009 - search.proquest.com
Traditionally, machine learning algorithms assume that training data is provided as a set of
independent instances, each of which can be described as a feature vector. In contrast …
independent instances, each of which can be described as a feature vector. In contrast …
Improving the accuracy and scalability of discriminative learning methods for Markov logic networks
TN Huynh - 2011 - repositories.lib.utexas.edu
Many real-world problems involve data that both have complex structures and uncertainty.
Statistical relational learning (SRL) is an emerging area of research that addresses the …
Statistical relational learning (SRL) is an emerging area of research that addresses the …
[PDF][PDF] ON THE EFFECTIVE REVISION OF (BAYESIAN) LOGIC PROGRAMS
AM Paes - 2011 - cos.ufrj.br
Artificial Intelligence is concerned with building computer programs that solve problems
which would require intelligence if solved by a human. As intelligence requires learning, to …
which would require intelligence if solved by a human. As intelligence requires learning, to …