Sciweavers

232 search results - page 16 / 47
» Completeness and Decidability in Sequence Logic
Sort
View
KGC
1993
Springer
13 years 11 months ago
Nonmonotonic Reasoning is Sometimes Simpler
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
Grigori Schwarz, Miroslaw Truszczynski
ITC
1996
IEEE
127views Hardware» more  ITC 1996»
13 years 11 months ago
Altering a Pseudo-Random Bit Sequence for Scan-Based BIST
This paper presents a low-overhead scheme for built-in self-test of circuits with scan. Complete (100%) fault coverage is obtained without modifying the function logic and without...
Nur A. Touba, Edward J. McCluskey
JANCL
2006
74views more  JANCL 2006»
13 years 7 months ago
Linear-time temporal logics with Presburger constraints: an overview
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
Stéphane Demri
CADE
2003
Springer
14 years 7 months ago
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
Renate A. Schmidt, Ullrich Hustadt
FOSSACS
2009
Springer
14 years 2 months ago
Coalgebraic Hybrid Logic
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
Rob Myers, Dirk Pattinson, Lutz Schröder