Sciweavers

3119 search results - page 160 / 624
» General Default Logic
Sort
View
ICTCS
2003
Springer
14 years 3 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
CSFW
2010
IEEE
14 years 2 months ago
Constraining Credential Usage in Logic-Based Access Control
—Authorization logics allow concise specification of flexible access-control policies, and are the basis for logic-based access-control systems. In such systems, resource owner...
Lujo Bauer, Limin Jia, Divya Sharma
DATE
2004
IEEE
123views Hardware» more  DATE 2004»
14 years 2 months ago
Synthesis and Optimization of Threshold Logic Networks with Application to Nanotechnologies
We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currentl...
Rui Zhang, Pallav Gupta, Lin Zhong, Niraj K. Jha
CCS
2008
ACM
14 years 20 days ago
On the protocol composition logic PCL
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
Cas J. F. Cremers
AIML
2004
14 years 2 days ago
A Systematic Proof Theory for Several Modal Logics
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
Charles Stewart, Phiniki Stouppa