Sciweavers

912 search results - page 168 / 183
» Abstract Saturation-Based Inference
Sort
View
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 1 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
ECAI
1998
Springer
14 years 1 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
DAGSTUHL
2007
13 years 11 months ago
Interdisciplinary Design Research for End-User Software Engineering
rocesses involve modeling – simplifying or abstracting some aspects of the problem domain in order to plan and evaluate design decisions. The use of representations to reason abo...
Alan F. Blackwell
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 9 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
CVPR
1998
IEEE
14 years 11 months ago
Action Recognition Using Probabilistic Parsing
A new approach to the recognition of temporal behaviors and activities is presented. The fundamental idea, inspired by work in speech recognition, is to divide the inference probl...
Aaron F. Bobick, Yuri A. Ivanov