Sciweavers

81 search results - page 10 / 17
» Approximations of Modal Logic K
Sort
View
DATE
2009
IEEE
107views Hardware» more  DATE 2009»
14 years 1 months ago
Sequential logic rectifications with approximate SPFDs
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
Yu-Shen Yang, Subarna Sinha, Andreas G. Veneris, R...
SLOGICA
2002
98views more  SLOGICA 2002»
13 years 9 months ago
A Cut-Free Sequent System for the Smallest Interpretability Logic
In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose -free fragment is th...
Katsumi Sasaki
TABLEAUX
1998
Springer
14 years 2 months ago
Fibring Semantic Tableaux
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...
Bernhard Beckert, Dov M. Gabbay
JANCL
2002
121views more  JANCL 2002»
13 years 9 months ago
Approximate coherence-based reasoning
ABSTRACT. It has long been recognized that the concept of inconsistency is a central part of commonsense reasoning. In this issue, a number of authors have explored the idea of rea...
Frédéric Koriche
STACS
2000
Springer
14 years 1 months ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra