Sciweavers

3342 search results - page 196 / 669
» Automating Abstract Interpretation
Sort
View
EWCBR
2008
Springer
15 years 1 months ago
Case-Based Reasoning and the Statistical Challenges
ers in brackets denote the page numbers of the abstracts. If several authors are present then the one presenting is marked by an asterisk. Invited speakers Invited speakers Silbers...
Petra Perner
FLOPS
2008
Springer
15 years 1 months ago
A Generalization of the Folding Rule for the Clark-Kunen Semantics
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
Javier Álvez, Paqui Lucio
DLOG
2001
15 years 26 days ago
Optimizing Reasoning in Description Logics with Qualified Number Restrictions
In this extended abstract an optimization technique, the so-called signature calculus, for reasoning with number restrictions in description logics is investigated. The calculus i...
Volker Haarslev, Ralf Möller
CSL
2008
Springer
15 years 17 days ago
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama,...
CORR
2007
Springer
96views Education» more  CORR 2007»
14 years 11 months ago
Edit and verify
Abstract. Automated theorem provers are used in extended static checking, where they are the performance bottleneck. Extended static checkers are run typically after incremental ch...
Radu Grigore, Michal Moskal