Sciweavers

2035 search results - page 31 / 407
» On the complexity of stratified logics
Sort
View
81
Voted
LATA
2010
Springer
15 years 7 months ago
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
Neda Saeedloei and Gopal Gupta
88
Voted
AML
2006
106views more  AML 2006»
14 years 10 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
85
Voted
FORMATS
2008
Springer
14 years 11 months ago
MTL with Bounded Variability: Decidability and Complexity
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...
Carlo A. Furia, Matteo Rossi
74
Voted
IPL
2006
120views more  IPL 2006»
14 years 10 months ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
Martin Lange, Rafal Somla
85
Voted
DLOG
2003
14 years 11 months ago
Fixpoint Extensions of Temporal Description Logics
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...
Enrico Franconi, David Toman