Dependency relation

Known as: Reliance alphabet, Concurrent alphabet, Dependency

In mathematics and computer science, a dependency relation is a binary relation that is finite, symmetric, and reflexive; i.e. a finite tolerance…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

In this paper, we describe Mumpitz, the system we submitted to the PARSEME Shared task on automatic identification of verbal…

2013

RESUME La these presente une serie d'algorithmes originaux visant a optimiser la geometrie de chantiers souterrains en 3D…

2011

We develop a Web ontology rule language, called WORL, which combines a variant of OWL 2 RL with eDatalog-with-negation. We…

2010

Statistical machine translation (SMT) models have recently begun to include source context modeling, under the assumption that…

2005

2005

ML-style modules and classes are complementary. The former are better at structuring and genericity, the latter at extension and…

1998

The purpose of partial-order reduction techniques is to avoid exploring several interleavings of independent transitions when…

1995

Many data mining algorithms developed recently are based on inductive learning methods. Very few are based on similarity-based…

1994

In this paper, we rst tackle a natural problem from distributed computing, involving time-stamps. We then show that our solution…

1991

We here discuss an invariant semantics of concurrent systems which is a generalisation of the causal partial order (CPO…