Sciweavers

51 search results - page 4 / 11
» cade 2008
Sort
View
CADE
2008
Springer
14 years 5 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CADE
2008
Springer
14 years 5 months ago
Proof Systems for Effectively Propositional Logic
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
Andrei Voronkov, Juan Antonio Navarro Pérez
CADE
2008
Springer
14 years 5 months ago
The Complexity of Conjunctive Query Answering in Expressive Description Logics
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
Carsten Lutz
CADE
2008
Springer
14 years 5 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 5 months ago
Collaborative Programming: Applications of Logic and Automated Reasoning
Collaborative Programming is characterized by groups of people issuing instructions to computer systems. Collaborative Programming languages differ from traditional programming lan...
Timothy L. Hinrichs