Buscar
Mostrando ítems 1-5 de 5
Ponencia
Molecular Computation Models in ACL2: a Simulation of Lipton’s Experiment Solving SAT
(2002)
In this paper we present an ACL2 formalization of a molecular computing model: Adleman’s restricted model [2]. This is a first step to formalize unconventional models of computation in ACL2. As an application of this ...
Ponencia
Towards a Practical Argumentative Reasoning with Qualitative Spatial Databases
(Springer, 2003)
Classical database management can be flawed if the Knowledge database is built within a complex Knowledge Domain. We must then deal withinconsistencies and, in general, withanomalies of several types. In this paper we ...
Ponencia
A methodology for the computer-aided cleaning of complex knowledge databases
(IEEE Computer Society, 2002)
In environments with complex cognitive structure (such as semantic web or sophisticated spatial databases for geographical information systems), classical methods for detecting anomalies can be inadequate. In this paper ...
Ponencia
Generalizing Programs via Subsumption
(Springer, 2003)
In this paper we present a class of operators for Machine Learning based on Logic Programming which represents a characterization of the subsumption relation in the following sense: The clause C 1 subsumes the clause C 2 ...
Ponencia
A Quasi-Metric for Machine Learning
(Springer, 2002)
The subsumption relation is crucial in the Machine Learning systems based on a clausal representation. In this paper we present a class of operators for Machine Learning based on clauses which is a characterization of the ...