Sciweavers

3758 search results - page 15 / 752
» A Complete Subsumption Algorithm
Sort
View
JAIR
2002
134views more  JAIR 2002»
13 years 7 months ago
Specific-to-General Learning for Temporal Events with Application to Learning Event Definitions from Video
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
Alan Fern, Robert Givan, Jeffrey Mark Siskind
CORR
2011
Springer
170views Education» more  CORR 2011»
12 years 11 months ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano
CADE
1998
Springer
13 years 11 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
ER
2004
Springer
103views Database» more  ER 2004»
14 years 27 days ago
Modeling Default Induction with Conceptual Structures
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
Julien Velcin, Jean-Gabriel Ganascia