Sciweavers

167 search results - page 21 / 34
» Mathematical Logic and Deduction in Computer Science Educati...
Sort
View
FOCS
1998
IEEE
15 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
VMCAI
2010
Springer
15 years 6 months ago
Advances in Probabilistic Model Checking
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...
Joost-Pieter Katoen
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 1 months ago
A Foundational View on Integration Problems
The integration of reasoning and computation services across system and language boundaries has been mostly treated from an engineering perspective. In this paper we take a foundat...
Florian Rabe, Michael Kohlhase, Claudio Sacerdoti ...
ERSHOV
2001
Springer
15 years 2 months ago
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Jan Friso Groote, Hans Zantema
RELMICS
2000
Springer
15 years 1 months ago
A Decision Method for Duration Calculus
Abstract: The Duration Calculus is an interval logic introduced for designing realtime systems. This calculus is able to capture important real-time problems like the speci cation ...
Nathalie Chetcuti-Sperandio, Luis Fariñas d...