Sciweavers

4401 search results - page 172 / 881
» Computing with Default Logic
Sort
View
TACS
2001
Springer
15 years 8 months ago
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
Hiroshi Nakano
DATE
2004
IEEE
125views Hardware» more  DATE 2004»
15 years 7 months ago
Extremely Low-Power Logic
For extremely Low-power Logic, three very new and promising techniques will be described. The first are methods on circuit and system level for reduced supply voltages. In large l...
Christian Piguet, Jacques Gautier, Christoph Heer,...
AAAI
2008
15 years 6 months ago
A Semantic Approach for Iterated Revision in Possibilistic Logic
In this paper, we propose a new approach for iterated revision in possibilistic logic by applying a one-step revision operator. We first argue that the set of KM postulates for re...
Guilin Qi
DLOG
2009
15 years 1 months ago
Quasi-Classical Semantics for Expressive Description Logics
Abstract. Inconsistency handling in expressive description logics is an important problem because inconsistency may naturally occur in an open world. In this paper, we present the ...
Xiaowang Zhang, Guilin Qi, Yue Ma, Zuoquan Lin
145
Voted
IJIS
2011
83views more  IJIS 2011»
14 years 7 months ago
Conceptual modeling in full computation-tree logic with sequence modal operator
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
Ken Kaneiwa, Norihiro Kamide