Sciweavers

2035 search results - page 70 / 407
» On the complexity of stratified logics
Sort
View
FPGA
2001
ACM
137views FPGA» more  FPGA 2001»
15 years 10 months ago
Detailed routing architectures for embedded programmable logic IP cores
As the complexity of integrated circuits increases, the ability to make post-fabrication changes to fixed ASIC chips will become more and more attractive. This ability can be real...
Peter Hallschmid, Steven J. E. Wilton
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
15 years 10 months ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
ENTCS
2006
121views more  ENTCS 2006»
15 years 6 months ago
A Logic for Graphs with QoS
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
GianLuigi Ferrari, Alberto Lluch-Lafuente
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 6 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 10 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman