Sciweavers

395 search results - page 13 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
OPODIS
2003
13 years 11 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
SSS
2007
Springer
14 years 4 months ago
Global Predicate Detection in Distributed Systems with Small Faults
Abstract. We study the problem of global predicate detection in presence of permanent and transient failures. We term the transient failures as small faults. We show that it is imp...
Felix C. Freiling, Arshad Jhumka
EACL
2009
ACL Anthology
14 years 10 months ago
Deriving Generalized Knowledge from Corpora Using WordNet Abstraction
ion Benjamin Van Durme, Phillip Michalak and Lenhart K. Schubert Department of Computer Science University of Rochester Rochester, NY 14627, USA Existing work in the extraction of...
Benjamin Van Durme, Phillip Michalak, Lenhart Schu...
ICDT
1995
ACM
91views Database» more  ICDT 1995»
14 years 1 months ago
Some Positive Results for Boundedness of Multiple Recursive Rules
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
Ke Wang
STACS
2010
Springer
14 years 3 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov