Sciweavers

257 search results - page 38 / 52
» The Connectionist Inductive Learning and Logic Programming S...
Sort
View
FCT
2007
Springer
15 years 5 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
IJCAI
2001
15 years 1 months ago
Mining Soft-Matching Rules from Textual Data
Text mining concerns the discovery of knowledge from unstructured textual data. One important task is the discovery of rules that relate specific words and phrases. Although exist...
Un Yong Nahm, Raymond J. Mooney
111
Voted
CIG
2005
IEEE
15 years 5 months ago
Nannon: A Nano Backgammon for Machine Learning Research
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
Jordan B. Pollack
AAAI
2007
15 years 2 months ago
Generality and Equivalence Relations in Default Logic
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
Katsumi Inoue, Chiaki Sakama
91
Voted
JUCS
2006
104views more  JUCS 2006»
14 years 11 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...