Sciweavers

2035 search results - page 265 / 407
» On the complexity of stratified logics
Sort
View
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
15 years 11 months ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
LICS
2003
IEEE
15 years 11 months ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
DAWAK
2003
Springer
15 years 11 months ago
Handling Large Workloads by Profiling and Clustering
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...
Matteo Golfarelli
ICLP
2003
Springer
15 years 11 months ago
On Deterministic Computations in the Extended Andorra Model
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
Ricardo Lopes, Vítor Santos Costa, Fernando...
DATE
2002
IEEE
79views Hardware» more  DATE 2002»
15 years 11 months ago
Incremental Diagnosis and Correction of Multiple Faults and Errors
An incremental simulation-based approach to fault diagnosis and logic debugging is presented. During each iteration of the algorithm, a single suspicious location is identified a...
Andreas G. Veneris, Jiang Brandon Liu, Mandana Ami...