Sciweavers

778 search results - page 51 / 156
» Expressiveness and complexity of graph logic
Sort
View
100
Voted
CSFW
2005
IEEE
15 years 6 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
108
Voted
DLOG
2009
14 years 10 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
108
Voted
QSHINE
2005
IEEE
15 years 6 months ago
Adaptive Low-Complexity Erasure-Correcting Code-Based Protocols for QoS-Driven Mobile Multicast Services
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
Qinghe Du, Xi Zhang
115
Voted
DLOG
2009
14 years 10 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
SWAP
2007
15 years 1 months ago
Who the FOAF knows Alice? RDF Revocation in DBin 2.0
In this paper we take a view from the bottom to RDF(S) reasoning. We discuss some issues and requirements on reasoning towards effectively building Semantic Web Pipes, aggregating ...
Christian Morbidoni, Axel Polleres, Giovanni Tumma...