Sciweavers

1032 search results - page 38 / 207
» Extended Computation Tree Logic
Sort
View
SYNTHESE
2008
88views more  SYNTHESE 2008»
14 years 9 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
ISMVL
2003
IEEE
117views Hardware» more  ISMVL 2003»
15 years 3 months ago
CTL Model-Checking over Logics with Non-Classical Negations
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois an...
Marsha Chechik, Wendy MacCaull
JLP
2008
81views more  JLP 2008»
14 years 9 months ago
Cut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary ru...
Kai Brünnler, Martin Lange
AI
2002
Springer
14 years 9 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
APSEC
2005
IEEE
15 years 3 months ago
A Temporal Logic for Input Output Symbolic Transition Systems
— In this paper, we present a temporal logic called F whose interpretation is over Input Output Symbolic Transition Systems (IOSTS). IOSTS extend transition systems to communicat...
Marc Aiguier, Pascale Le Gall, Delphine Longuet, A...