Sciweavers

239 search results - page 15 / 48
» Duality for Logics of Transition Systems
Sort
View
CADE
2012
Springer
11 years 10 months ago
EPR-Based Bounded Model Checking at Word Level
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
Moshe Emmer, Zurab Khasidashvili, Konstantin Korov...
LOGCOM
2006
101views more  LOGCOM 2006»
13 years 7 months ago
Tableau-based Decision Procedures for Hybrid Logic
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision p...
Thomas Bolander, Torben Braüner
20
Voted
AMAST
1997
Springer
13 years 11 months ago
Symbolic Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is de ned, following the approach taken for message passing CCS in HL95a], altered to take account of th...
Carron Shankland, Muffy Thomas
LPNMR
2007
Springer
14 years 1 months ago
Using Answer Sets to Solve Belief Change Problems
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
Aaron Hunter, James P. Delgrande, Joel Faber
REX
1991
13 years 11 months ago
Logics and Models of Real Time: A Survey
We survey logic-based and automata-based languages and techniques for the speci cation and veri cation of real-time systems. In particular, we discuss three syntactic extensions of...
Rajeev Alur, Thomas A. Henzinger