Sciweavers

ESSLLI
1999
Springer
14 years 3 months ago
Representing the Adverb Very in Fuzzy Set Theory
We recall the concept of a linguistic variable and the representation of its values (i.e. linguistic terms) by means of fuzzy sets. In this framework adverbs are represented by fuz...
Martine De Cock
ESSLLI
1999
Springer
14 years 3 months ago
Setting up Exhausted Values
This paper argues that exhaustification is empirically and theoretically important as a tool in the semantic description of various constructions in natural language. Discussion f...
Alastair Butler
ESSLLI
1999
Springer
14 years 3 months ago
Scope, Topichood and Double Objects
Patrick Brandt
ESSLLI
1999
Springer
14 years 3 months ago
Weak Equivalence in Propositional Calculus
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
Stefan Andrei
LICS
1999
IEEE
14 years 3 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
LICS
1999
IEEE
14 years 3 months ago
Proving Security Protocols Correct
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
Lawrence C. Paulson
LICS
1999
IEEE
14 years 3 months ago
Entailment of Atomic Set Constraints is PSPACE-Complete
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
Joachim Niehren, Martin Müller, Jean-Marc Tal...