Results 21  30
of
509
A Framework for Partof Hierarchies in Terminological Logics
 In Proc. of the 4 th International Conference on Principles of Knowledge Representation and Reasoning
, 1994
"... There is a growing recognition that partwhole hierarchies are a very general form of representation, widely used by humans in commonsense reasoning. This paper develops a terminological logic, and related inference mechanisms for representing and reasoning about composite concepts and individuals. A ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
There is a growing recognition that partwhole hierarchies are a very general form of representation, widely used by humans in commonsense reasoning. This paper develops a terminological logic, and related inference mechanisms for representing and reasoning about composite concepts and individuals
Default reasoning and inheritance mechanisms on type hierarchies
 in: Proceedings Workshop on Data Abstraction, Databases, and Conceptual Modelling, Pingree Park, CO
, 1980
"... Type hierarchies abound in Artificial Intelligence, Data Bases and Programming Languages. Although their size, use and complexity differs, all share a central inference mechanism: Inheritance of information, their raison d'etre. This paper discusses various types of type hierarchies and inherit ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Type hierarchies abound in Artificial Intelligence, Data Bases and Programming Languages. Although their size, use and complexity differs, all share a central inference mechanism: Inheritance of information, their raison d'etre. This paper discusses various types of type hierarchies
Mechanisms of predictive and diagnostic causal induction
 Journal of Experimental Psychology: Animal Behavior Processes
, 2002
"... In predictive causal inference, people reason from causes to effects, whereas in diagnostic inference, they reason from effects to causes. Independently of the causal structure of the events, the temporal structure of the information provided to a reasoner may vary (e.g., multiple events followed by ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
In predictive causal inference, people reason from causes to effects, whereas in diagnostic inference, they reason from effects to causes. Independently of the causal structure of the events, the temporal structure of the information provided to a reasoner may vary (e.g., multiple events followed
A knowledgeintensive genetic algorithm for supervised learning
, 1993
"... Abstract. Supervised learning in attributebased spaces is one of the most popular machine learning problems studied and, consequently, has attracted considerable attention of the genetic algorithm community. The fullmemory approach developed here uses the same nighlevel descriptive language that i ..."
Abstract

Cited by 94 (1 self)
 Add to MetaCart
that is used in rulebased systems. This allows for an easy utilization of inference rules of the wellknown inductive learning methodology, which replace the traditional domainindependent operators and make the search taskspecific. Moreover, a closer relationship between the underlying task
Adaptive Intrusion Detection: a Data Mining Approach
 Artificial Intelligence Review
, 2000
"... In this paper we describe a data mining framework for constructing intrusion detection models. The first key idea is to mine system audit data for consistent and useful patterns of program and user behavior. The other is to use the set of relevant system features presented in the patterns to compute ..."
Abstract

Cited by 96 (1 self)
 Add to MetaCart
to compute inductively learned classifiers that can recognize anomalies and known intrusions. In order for the classifiers to be effective intrusion detection models, we need to have sufficient audit data for training and also select a set of predictive system features. We propose to use the association
Type inference with algebraic universes in the Calculus of Inductive Constructions
"... Abstract. We describe an algebraic system of universes and a typechecking algorithm for universe constraints in a version of the extended calculus of constructions with inductive types. The use of algebraic universes ensures that the graph of constraints only contains universes already present in th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We describe an algebraic system of universes and a typechecking algorithm for universe constraints in a version of the extended calculus of constructions with inductive types. The use of algebraic universes ensures that the graph of constraints only contains universes already present
LatticebasedAnomalyRectificationfor SportVideoAnnotation
"... Abstract—Anomaly detection has received much attention within the literature as a means of determining, in an unsupervised manner, whether a learning domain has changed in a fundamental way. This may require continuous adaptive learning to be abandoned and a new learning process initiated in the new ..."
Abstract
 Add to MetaCart
in the new domain. A related problem is that of anomaly rectification; the adaptation of the existing learning mechanism to the change of domain. As a concrete instantiation of this notion, the current paper investigates a novel latticebased HMM induction strategy for arbitrary courtgame environments. We
Multitype Inference In Multistrategy TaskAdaptive Learning: Dynamic Interlaced Hierarchies
 in R.S. Michalski and G. Tecuci (Eds.), Proc. 2 nd Int. Workshop on Multistrategy Learning, Harpers
, 1993
"... Research on multistrategy taskadaptive learning aims at integrating all basic inferential learning strategieslearning by deduction, induction and analogy. The implementation of such a learning system requires a knowledge representation that facilitates performing a multitype inference in a seamles ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Research on multistrategy taskadaptive learning aims at integrating all basic inferential learning strategieslearning by deduction, induction and analogy. The implementation of such a learning system requires a knowledge representation that facilitates performing a multitype inference in a
The Semantics of Reflected Proof
 IN PROC. OF FIFTH SYMP. ON LOGIC IN COMP. SCI
, 1990
"... We begin to lay the foundations for reasoning about proofs whose steps include both invocations of programs to build subproofs (tactics) and references to representations of proofs themselves (reflected proofs). The main result is the definition of a single type of proof which can mention itself, ..."
Abstract

Cited by 95 (11 self)
 Add to MetaCart
proof involving only primitive inference rules. We also show how to extend the results to proofs from which programs (such as tactics) can be derived, and to proofs that can refer to a library of definitions and previously proven theorems. We believe that the mechanism of reflection is fundamental
A Model of Yukawa Hierarchies
, 1997
"... We present a model for the observed hierarchies among the Yukawa couplings of the standard model in the context of an effective low energy theory with an anomalous U(1) symmetry. This symmetry, a generic feature of superstring compactification, is a remnant of the GreenSchwarz anomaly cancellation ..."
Abstract
 Add to MetaCart
mechanism. The gauge group is that of the standard model, augmented by X, the anomalous U(1), and two familydependent phase symmetries Y (1) and Y (2). The correct hierarchies are reproduced only when sin 2 θw = 3/8 at the cutoff. To cancel anomalies, righthanded neutrinos and other standard model
Results 21  30
of
509