Sciweavers

522 search results - page 37 / 105
» Real-time Logics: Complexity and Expressiveness
Sort
View
CSFW
2005
IEEE
14 years 2 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
DLOG
2009
13 years 6 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
DLOG
2009
13 years 6 months ago
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
Thomas Lukasiewicz, Azzurra Ragone
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 9 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 8 months ago
Logic Meets Algebra: the Case of Regular Languages
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
Pascal Tesson, Denis Thérien