Sciweavers

1941 search results - page 163 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
135
Voted
IGPL
2007
125views more  IGPL 2007»
15 years 3 months ago
Morph Moulder: Teaching Software for HPSG and Description Logics
The graphical software Morph Moulder (MoMo) presented here was originally created for teaching the logical foundations of Head-Driven Phrase Structure Grammar (HPSG) in an e-Learn...
Ekaterina Ovchinnikova, Frank Richter
143
Voted
ECAI
2010
Springer
15 years 4 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
123
Voted
DLOG
2008
15 years 5 months ago
SRIQ and SROIQ are Harder than SHOIQ
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
Yevgeny Kazakov
106
Voted
CADE
2008
Springer
16 years 3 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
CADE
2006
Springer
16 years 3 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer