Sciweavers

1331 search results - page 163 / 267
» Description logic reasoning using the PTTP approach
Sort
View
JAPLL
2007
88views more  JAPLL 2007»
15 years 6 months ago
Some comments on history based structures
History based models, introduced by Parikh and Ramanujam, provide a natural mathematical model of social interactive situations. These models offer a ”low level” description ...
Eric Pacuit
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
16 years 23 days ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...
LOGCOM
2007
115views more  LOGCOM 2007»
15 years 6 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
CADE
2008
Springer
16 years 6 months ago
Bitfields and Tagged Unions in C: Verification through Automatic Generation
We present a tool for automatic generation of packed bitfields and tagged unions for systems-level C, along with automatic, machine checked refinement proofs in Isabelle/HOL. Our a...
David Cock