Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
Proceedings of the 17th International Conference on Logic Programming
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
25 Years of Model Checking
Propositional Dynamic Logic for Recursive Procedures
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Propositional Dynamic Logic with Program Quantifiers
Electronic Notes in Theoretical Computer Science (ENTCS)
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Pillars of computer science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Hi-index | 0.00 |
In this paper, we use crossing number and wire area arguments to find lower bounds on the layout area and maximum edge length of a variety of computationally useful networks. In particular, we describe 1) an N-node planar graph which has layout area ...