846 search results - page 60 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
79
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relationa...
TCAD
2008
15 years 17 days ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
109
click to vote
KGC
1993
Springer
15 years 4 months ago
1993
Springer
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...
95
Voted
LOGCOM
2007
15 years 16 days ago
2007
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
76
Voted
CF
2006
ACM
15 years 6 months ago
2006
ACM
Bytecode hardware-translation improves the performance of a Java Virtual Machine (JVM) with small hardware resource and complexity overhead. Instruction folding is a technique to ...