The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 21 –
40 of
197
In the last decade, formal methods have proved their interest when
analyzing security protocols. Security protocols require in
particular to reason about the attacker knowledge. Two standard
notions are often considered in formal approaches: deducibility and
indistinguishability relations. The first notion states whether an
attacker can learn the value of a secret, while the latter states
whether an attacker can notice some difference between protocol runs
with different values of the secret. Several...
We consider logics on
and which are weaker than
Presburger arithmetic and
we settle the following decision
problem: given a k-ary
relation on and
which are first order definable in
Presburger arithmetic, are they definable in these
weaker logics? These logics, intuitively,
are obtained by considering modulo and threshold counting predicates for differences of two variables.
We consider the four families of recognizable, synchronous,
deterministic rational and rational subsets of a direct product
of free monoids.
They form a strict hierarchy and we investigate the following
decision problem: given a relation in one of the families,
does it belong to a smaller family?
We settle the problem entirely when all monoids have a unique
generator and fill some gaps in the general case.
In particular, adapting a proof of Stearns, we show that it is recursively decidable
whether...
In this paper we argue that for fuzzy unification we need a procedural and declarative semantics (as opposed to the two valued case, where declarative semantics is hidden in the requirement that unified terms are syntactically – letter by letter – identical). We present an extension of the syntactic model of unification to allow near matches, defined using a similarity relation. We work in Hájek’s fuzzy logic in narrow sense. We base our semantics on a formal model of fuzzy logic programming extended...
In this paper we present a novel approach to decomposing high dimensional spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical classification. This strategy of pre-processing the data and explicitly optimising the partitions for subsequent mapping onto a hierarchical classifier is found to both reduce the learning complexity and the classification time with no degradation in overall classification error rate. Results of partitioning pattern spaces...
Commonsense reasoning is the reasoning of agents interacting with the real world. Non monotonic reasoning is a well developed research area gathering the logical formalisms that treat commonsense reasoning. One of the best known of such formalisms is Default logic. In this paper we discuss Default logic at both the proof-theoretic and semantics levels and show that Default logic provides a clear and formal framework to understand the logical nature of commonsense reasoning.
Currently displaying 21 –
40 of
197