Sciweavers

844 search results - page 150 / 169
» Safraless Decision Procedures
Sort
View
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 8 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
IJCV
2000
164views more  IJCV 2000»
13 years 8 months ago
Probabilistic Modeling and Recognition of 3-D Objects
This paper introduces a uniform statistical framework for both 3-D and 2-D object recognition using intensity images as input data. The theoretical part provides a mathematical too...
Joachim Hornegger, Heinrich Niemann
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
JAIR
1998
163views more  JAIR 1998»
13 years 8 months ago
A Temporal Description Logic for Reasoning about Actions and Plans
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true whil...
Alessandro Artale, Enrico Franconi
TSMC
2002
114views more  TSMC 2002»
13 years 8 months ago
Exploiting design information to derive object distribution models
Object-orientation and distributed systems are quickly becoming norms for new system development, generating renewed interest in distribution schemes traditionally directed at rela...
Sandeep Purao, Hemant K. Jain, Derek L. Nazareth