Sciweavers

479 search results - page 12 / 96
» A quantified logic of evidence
Sort
View
IANDC
2010
95views more  IANDC 2010»
13 years 5 months ago
Structured anaphora to quantifier domains
The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with...
Adrian Brasoveanu
FSKD
2006
Springer
125views Fuzzy Logic» more  FSKD 2006»
13 years 11 months ago
Towards Security Evaluation Based on Evidence Collection
Information security evaluation of software-intensive systems typically relies heavily on the experience of the security professionals. Obviously, automated approaches are needed ...
Reijo Savola
ATVA
2007
Springer
105views Hardware» more  ATVA 2007»
14 years 2 months ago
Quantifying the Discord: Order Discrepancies in Message Sequence Charts
Message Sequence Charts (MSCs) and High-level Message Sequence Charts (HMSCs) are formalisms used to describe scenarios of message passing protocols. We propose using Allen’s log...
Edith Elkind, Blaise Genest, Doron Peled, Paola Sp...
FMCAD
2006
Springer
13 years 11 months ago
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
Florian Pigorsch, Christoph Scholl, Stefan Disch
CSR
2008
Springer
13 years 8 months ago
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
Arnon Avron, Anna Zamansky