Sciweavers

581 search results - page 61 / 117
» Coordination in answer set programming
Sort
View
AAAI
2008
13 years 11 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
ENTCS
2006
115views more  ENTCS 2006»
13 years 8 months ago
Distributed Reactive XML
XML-centric models of computation have been proposed as an answer to the demand for interoperability, heterogeneity and openness in coordination models. We present a prototype imp...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen,...
BMCBI
2007
148views more  BMCBI 2007»
13 years 8 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 8 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
AICOM
2006
129views more  AICOM 2006»
13 years 9 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone