Sciweavers

2062 search results - page 73 / 413
» Derivatives of Logical Formulas
Sort
View
CSR
2010
Springer
15 years 3 months ago
Prehistoric Phenomena and Self-referentiality
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : Ï•(t), which have self-referential meanings. In this paper, “prehistoric phenomenaâ€...
Junhua Yu
FSTTCS
2000
Springer
15 years 2 months ago
Model Checking CTL Properties of Pushdown Systems
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
Igor Walukiewicz
97
Voted
JSYML
2008
86views more  JSYML 2008»
14 years 11 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff
IPMU
2010
Springer
14 years 9 months ago
Keeping Secrets in Possibilistic Knowledge Bases with Necessity-Valued Privacy Policies
Controlled Query Evaluation (CQE) is a logical framework for the protection of secrets in databases. In this article, we extend the CQE framework to possibilistic logic: knowledge ...
Lena Wiese
FUIN
2010
172views more  FUIN 2010»
14 years 8 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...