846 search results - page 21 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
TCS
2010
14 years 7 months ago
2010
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
CIE
2008
Springer
14 years 9 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
115
click to vote
LOGCOM
2010
14 years 4 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
ISMVL
1994
IEEE
15 years 1 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...