Sciweavers

291 search results - page 20 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
FUIN
2007
135views more  FUIN 2007»
13 years 7 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
ENTCS
2006
189views more  ENTCS 2006»
13 years 7 months ago
Variables as Resource for Shared-Memory Programs: Semantics and Soundness
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
Stephen D. Brookes
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 7 months ago
The craft of model making: PSPACE bounds for non-iterative modal logics
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
Lutz Schröder, Dirk Pattinson
JOLLI
2006
76views more  JOLLI 2006»
13 years 7 months ago
A Modal Interpretation of the Logic of Interrogation
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniq...
Rani Nelken, Chung-chieh Shan