Sciweavers

114 search results - page 9 / 23
» Mind Change Complexity of Learning Logic Programs
Sort
View
UAI
2008
13 years 9 months ago
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
Sebastian Riedel
ACE
2004
222views Education» more  ACE 2004»
13 years 9 months ago
Learning about Software Development - Should Programming Always Come First?
The issues surrounding curriculum design of many Computer Science and Software Engineering degree programs1 are many and complex. In particular, the question of whether prior prog...
Margaret Hamilton, Liz Haywood
APPT
2003
Springer
14 years 25 days ago
Scheduling Outages in Distributed Environments
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
Anthony Butler, Hema Sharda, David Taniar
TPLP
2002
117views more  TPLP 2002»
13 years 7 months ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
ECML
2006
Springer
13 years 11 months ago
Automatically Evolving Rule Induction Algorithms
Research in the rule induction algorithm field produced many algorithms in the last 30 years. However, these algorithms are usually obtained from a few basic rule induction algorit...
Gisele L. Pappa, Alex Alves Freitas