895 search results - page 48 / 179 » A Spectrum of Applications of Automated Reasoning |
129
click to vote
DLOG
2008
15 years 7 months ago
2008
Least Common Subsumers in Description Logics have shown their usefulness for discovering commonalities among all concepts of a collection. Several applications are nevertheless foc...
164
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
162
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
148
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
156
click to vote
DLOG
2011
14 years 8 months ago
2011
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...