Sciweavers

4117 search results - page 312 / 824
» On the Satisfiability of Complex Constraints
Sort
View
IANDC
2008
122views more  IANDC 2008»
15 years 6 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
158
Voted
ETFA
2006
IEEE
16 years 26 days ago
VITRAL - A text mode window manager for real-time embedded kernels
This paper presents VITRAL, a multicolor text mode window manager designed for embedded real-time systems. Therefore, timeliness requirements and resource constraints are the main...
Manuel Coutinho, Carlos Almeida, José Rufin...
DEBU
1999
85views more  DEBU 1999»
15 years 6 months ago
Specifying Database Transformations in WOL
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
Susan B. Davidson, Anthony Kosky
ICPR
2006
IEEE
16 years 8 months ago
Semantic Understanding of Continued and Recursive Human Activities
This paper presents a methodology for semantic understanding of complex and continued human activities. A context-free grammar (CFG) based representation scheme developed earlier ...
J. K. Aggarwal, Michael S. Ryoo
GRC
2005
IEEE
16 years 13 days ago
Improved rule based rough set approach for target recognition
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
Yong Liu, Congfu Xu, Zhiyong Yan, Yunhe Pan