Sciweavers

2035 search results - page 234 / 407
» On the complexity of stratified logics
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
DSN
2002
IEEE
15 years 11 months ago
Model Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
Boudewijn R. Haverkort, Lucia Cloth, Holger Herman...
TPHOL
1999
IEEE
15 years 10 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
AIIDE
2008
15 years 8 months ago
Recombinable Game Mechanics for Automated Design Support
Systems that provide automated game-design support-whether fully automated game generators, or tools to assist human designers--must be able to maintain a representation of a game...
Mark J. Nelson, Michael Mateas
DAC
2006
ACM
15 years 8 months ago
Systematic software-based self-test for pipelined processors
Software-based self-test (SBST) has recently emerged as an effective methodology for the manufacturing test of processors and other components in systems-on-chip (SoCs). By moving ...
Mihalis Psarakis, Dimitris Gizopoulos, Miltiadis H...