3119 search results - page 557 / 624 » General Default Logic |
111
click to vote
STOC
1999
ACM
15 years 5 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
121
Voted
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
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...
102
Voted
MFCS
1998
Springer
15 years 5 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
113
click to vote
AMOST
2007
ACM
15 years 4 months ago
2007
ACM
Model-checkers have recently been suggested for automated software test-case generation. Several works have presented methods that create efficient test-suites using model-checker...
102
Voted
AOSD
2007
ACM
15 years 4 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...