Sciweavers

338 search results - page 36 / 68
» Many Facets of Complexity in Logic
Sort
View
KR
2000
Springer
14 years 3 days ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
BDA
2004
13 years 10 months ago
A new way of optimizing OLAP queries
For around 10 years, the academic research in database has attempted to define a commonly agreed logical modeling for the multidimensional and hierarchical nature of data manipulat...
Arnaud Giacometti, Dominique Laurent, Patrick Marc...
MTDT
2003
IEEE
164views Hardware» more  MTDT 2003»
14 years 1 months ago
Applying Defect-Based Test to Embedded Memories in a COT Model
ct Defect-based testing for digital logic concentrates primarily on methods of test application, including for example at-speed structural tests and IDDQ testing. In contrast, defe...
Robert C. Aitken
LICS
2000
IEEE
14 years 28 days ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel
WIA
2000
Springer
14 years 2 days ago
MONA Implementation Secrets
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
Nils Klarlund, Anders Møller, Michael I. Sc...