Sciweavers

3119 search results - page 172 / 624
» General Default Logic
Sort
View
ATAL
2006
Springer
15 years 4 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
CCS
2006
ACM
15 years 4 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
133
Voted
CADE
2005
Springer
16 years 29 days ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
80
Voted
GLVLSI
2006
IEEE
115views VLSI» more  GLVLSI 2006»
15 years 6 months ago
Yield enhancement of asynchronous logic circuits through 3-dimensional integration technology
This paper presents a systematic design methodology for yield enhancement of asynchronous logic circuits using 3-D (3-Dimensional) integration technology. In this design, the targ...
Song Peng, Rajit Manohar
112
Voted
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
15 years 6 months ago
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
Bartek Klin