Sciweavers

365 search results - page 63 / 73
» First-order logical filtering
Sort
View
ICAISC
2010
Springer
13 years 8 months ago
Pruning Classification Rules with Reference Vector Selection Methods
Attempts to extract logical rules from data often lead to large sets of classification rules that need to be pruned. Training two classifiers, the C4.5 decision tree and the Non-Ne...
Karol Grudzinski, Marek Grochowski, Wlodzislaw Duc...
LICS
2008
IEEE
14 years 2 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
LICS
2006
IEEE
14 years 1 months ago
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. ...
ILP
2003
Springer
14 years 1 months ago
Mining Model Trees: A Multi-relational Approach
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
COOPIS
2002
IEEE
14 years 26 days ago
Formal Ontology Engineering in the DOGMA Approach
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
Mustafa Jarrar, Robert Meersman