Sciweavers

1302 search results - page 145 / 261
» Free-Style Theorem Proving
Sort
View
CADE
2001
Springer
16 years 4 months ago
Incremental Closure of Free Variable Tableaux
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
Martin Giese
PODS
2005
ACM
118views Database» more  PODS 2005»
16 years 4 months ago
On the complexity of division and set joins in the relational algebra
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
Dirk Leinders, Jan Van den Bussche
FOSSACS
2010
Springer
15 years 11 months ago
Coalgebraic Correspondence Theory
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
Lutz Schröder, Dirk Pattinson
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
15 years 11 months ago
Poly-logarithmic Independence Fools AC0 Circuits
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...
Mark Braverman
SSS
2009
Springer
138views Control Systems» more  SSS 2009»
15 years 11 months ago
Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios
We describe an approach to the analysis of protocols for wireless sensor networks in scenarios with mobile nodes and dynamic link quality. The approach is based on the theorem prov...
Cinzia Bernardeschi, Paolo Masci, Holger Pfeifer