Sciweavers

3244 search results - page 337 / 649
» Extensions to Description Logics
Sort
View
ENTCS
2006
172views more  ENTCS 2006»
15 years 6 months ago
Locality of Queries and Transformations
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structure...
Leonid Libkin
ICSE
2004
IEEE-ACM
16 years 6 months ago
Runtime Verification of Statechart Implementations
Our paper introduces a runtime verification framework for concurrent monitoring of applications specified by UML statecharts. The approach offers a considerable degree of granulari...
Gergely Pintér, István Majzik
ADC
2008
Springer
146views Database» more  ADC 2008»
16 years 1 months ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe
149
Voted
ASPDAC
2005
ACM
115views Hardware» more  ASPDAC 2005»
16 years 7 days ago
Low-power domino circuits using NMOS pull-up on off-critical paths
- Domino logic is used extensively in high speed microprocessor datapath design. Although domino gates have small propagation delay, they consume relatively more power. We propose ...
Abdulkadir Utku Diril, Yuvraj Singh Dhillon, Abhij...
ASP
2005
Springer
16 years 6 days ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre