4217 search results - page 100 / 844 » Computational indistinguishability logic |
AIML
1998
14 years 11 months ago
1998
Abstract. This paper presents a resolution decision procedure for transitive propositional modal logics. The procedure combines the relational translation method with an ordered ch...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which i...
GLVLSI
2006
IEEE
15 years 4 months ago
2006
IEEE
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
108
click to vote
CONCUR
2005
Springer
15 years 3 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
AAAI
2000
14 years 11 months ago
2000
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...