Sciweavers

827 search results - page 39 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
ACTA
2005
92views more  ACTA 2005»
13 years 7 months ago
Type-based information flow analysis for the pi-calculus
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
Naoki Kobayashi
DLOG
2011
12 years 11 months ago
Query Answering over SROIQ Knowledge Bases with SPARQL
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
Ilianna Kollia, Birte Glimm, Ian Horrocks
ESOP
2011
Springer
12 years 11 months ago
A New Method for Dependent Parsing
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
Trevor Jim, Yitzhak Mandelbaum
FCSC
2011
413views VLSI» more  FCSC 2011»
12 years 11 months ago
Type-2 fuzzy description logic
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...
Ruixuan Li, Kunmei Wen, Xiwu Gu, Yuhua Li, Xiaolin...
ICCV
2011
IEEE
12 years 7 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille