Sciweavers

CADE
2008
Springer
14 years 11 months ago
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Georg Struth, Peter Höfner
CADE
2008
Springer
14 years 11 months ago
The Logical Difference Problem for Description Logic Terminologies
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...
Boris Konev, Dirk Walther, Frank Wolter
CADE
2008
Springer
14 years 11 months ago
Individual Reuse in Description Logic Reasoning
Abstract. Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowl...
Boris Motik, Ian Horrocks
CADE
2008
Springer
14 years 11 months ago
Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
Mark Kaminski, Gert Smolka
CADE
2008
Springer
14 years 11 months ago
Quantitative Separation Logic and Programs with Lists
Marius Bozga, Radu Iosif, Swann Perarnau
CADE
2008
Springer
14 years 11 months ago
Automated Complexity Analysis Based on the Dependency Pair Method
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
Nao Hirokawa, Georg Moser
CADE
2008
Springer
14 years 11 months ago
Linear Quantifier Elimination
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
Tobias Nipkow
CADE
2008
Springer
14 years 11 months ago
MTT: The Maude Termination Tool (System Description)
Francisco Durán, Salvador Lucas, José...
CADE
2008
Springer
14 years 11 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
CADE
2008
Springer
14 years 11 months ago
Challenges in the Automated Verification of Security Protocols
Abstract. The application area of security protocols raises several problems that are relevant to automated deduction. We describe in this note some of these challenges.
Hubert Comon-Lundh