Sciweavers

436 search results - page 57 / 88
» Lightweight Rule Induction
Sort
View
BIRTHDAY
2006
Springer
14 years 1 months ago
Proving Behavioral Refinements of COL-specifications
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
Michel Bidoit, Rolf Hennicker
AAAI
1994
13 years 11 months ago
Inducing Deterministic Prolog Parsers from Treebanks: A Machine Learning Approach
or untagged treebanks. ' When trained on an untagged This paper presents a method for constructing deterministic Prolog parsers from corpora of parsed sentences. Our approach ...
John M. Zelle, Raymond J. Mooney
RAID
1999
Springer
14 years 2 months ago
Combining Knowledge Discovery and Knowledge Engineering to Build IDSs
We have been developing a data mining (i.e., knowledge discovery) framework, MADAM ID, for Mining Audit Data for Automated Models for Intrusion Detection [LSM98, LSM99b, LSM99a]. ...
Wenke Lee, Salvatore J. Stolfo
SEMWEB
2007
Springer
14 years 4 months ago
Ontology Merging using Answer Set Programming and Linguistic Knowledge
With the increasing number of ontologies available on the web, the problem of merging ontologies from different sources to interoperate applications becomes important. This paper ...
Jürgen Bock, Rodney W. Topor, Raphael Volz
POPL
2008
ACM
14 years 10 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...