Sciweavers

223 search results - page 37 / 45
» Logic programs with monotone abstract constraint atoms
Sort
View
WLP
1997
Springer
14 years 17 days ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
DC
2011
12 years 8 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
ICFEM
2004
Springer
14 years 1 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 8 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
SOFSEM
2009
Springer
14 years 5 months ago
Expressiveness of Multiple Heads in CHR
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiar...