Sciweavers

204 search results - page 29 / 41
» aim 1998
Sort
View
IGPL
1998
97views more  IGPL 1998»
13 years 8 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
13 years 8 months ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
INFSOF
1998
78views more  INFSOF 1998»
13 years 8 months ago
Program slices as an abstraction for cohesion measurement
Slices as an Abstraction for Cohesion Measurement Linda M. Ott Michigan Technological University James M. Bieman Colorado State University The basis for measuring many attributes ...
Linda M. Ott, James M. Bieman
JETAI
1998
110views more  JETAI 1998»
13 years 8 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
LOGCOM
1998
126views more  LOGCOM 1998»
13 years 8 months ago
Engineering AgentSpeak(L): A Formal Computational Model
Perhaps the most successful agent architectures, and certainly the best known, are those based on the Belief-Desire-Intention (BDI) framework. Despite the wealth of research that ...
Mark d'Inverno, Michael Luck