Sciweavers

64 search results - page 2 / 13
» Normal Forms for Inductive Logic Programming
Sort
View
MCMASTER
1993
13 years 8 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ICLP
2010
Springer
13 years 8 months ago
Inductive Logic Programming as Abductive Search
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
Domenico Corapi, Alessandra Russo, Emil Lupu
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
13 years 6 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
TLCA
2009
Springer
13 years 11 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
DLOG
2007
13 years 7 months ago
Exploiting Description Logic Reasoners in Inductive Logic
In spite of the increasing effort spent on building ontologies for the Semantic Web, little attention has been paid to the impact of these ontologies on knowledge-based intelligen...
Francesca A. Lisi