Sciweavers

2573 search results - page 472 / 515
» Combinations of Modal Logics
Sort
View
CN
1999
143views more  CN 1999»
15 years 3 months ago
Embedding Knowledge in Web Documents
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
Philippe Martin, Peter W. Eklund
TCAD
1998
115views more  TCAD 1998»
15 years 3 months ago
Probabilistic modeling of dependencies during switching activity analysis
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Radu Marculescu, Diana Marculescu, Massoud Pedram
TCAD
2002
121views more  TCAD 2002»
15 years 3 months ago
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
TITB
2002
142views more  TITB 2002»
15 years 3 months ago
Building a bioinformatics ontology using OIL
This paper describes the initial stages of building an ontology of bioinformatics and molecular biology. The conceptualisation is encoded using the Ontology Inference Layer (OIL),...
Robert Stevens, Carole A. Goble, Ian Horrocks, Sea...
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 3 months ago
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
Michael Bauland, Martin Mundhenk, Thomas Schneider...