Sciweavers

139 search results - page 3 / 28
» Modular difference logic is hard
Sort
View
JLP
2006
99views more  JLP 2006»
14 years 9 months ago
An institution of modal logics for coalgebras
This paper presents a modular framework for the specification of certain inductivelydefined coalgebraic types. Modal logics for coalgebras of polynomial endofunctors on the catego...
Corina Cîrstea
BPM
2006
Springer
115views Business» more  BPM 2006»
15 years 1 months ago
Modeling, Matching and Ranking Services Based on Constraint Hardness
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
Claudia d'Amato, Steffen Staab
DFT
2003
IEEE
154views VLSI» more  DFT 2003»
15 years 2 months ago
Fault Recovery Based on Checkpointing for Hard Real-Time Embedded Systems
Safety-critical embedded systems often operate in harsh environmental conditions that necessitate fault-tolerant computing techniques. Many safety-critical systems also execute re...
Ying Zhang, Krishnendu Chakrabarty
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 6 months ago
First steps in the logic-based assessment of post-composed phenotypic descriptions
In this paper we present a preliminary logic-based evaluation of the integration of post-composed phenotypic descriptions with domain ontologies. The evaluation has been performed ...
Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau,...
BIRTHDAY
2006
Springer
15 years 1 months ago
Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
Arnon Avron, Anna Zamansky