Sciweavers

419 search results - page 58 / 84
» Translation of Aggregate Programs to Normal Logic Programs
Sort
View
PKDD
2000
Springer
120views Data Mining» more  PKDD 2000»
13 years 11 months ago
Multi-Relational Data Mining, Using UML for ILP
Although there is a growing need for multi-relational data mining solutions in KDD, the use of obvious candidates from the field of Inductive Logic Programming (ILP) has been limit...
Arno J. Knobbe, Arno Siebes, Hendrik Blockeel, Dan...
ACL
2006
13 years 9 months ago
A Hybrid Relational Approach for WSD - First Results
We present a novel hybrid approach for Word Sense Disambiguation (WSD) which makes use of a relational formalism to represent instances and background knowledge. It is built using...
Lucia Specia
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 2 days ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
SIGSOFT
2006
ACM
14 years 1 months ago
Bit level types for high level reasoning
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
Ranjit Jhala, Rupak Majumdar
FAC
2008
114views more  FAC 2008»
13 years 7 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe