Results 1  10
of
243
unknown title
"... An alternating fixpoint tailored to magic programs * We study applying the magicsets transformation technique to Datalog programs with negation that may not have 2valued wellfounded models. In this general setting we encounter the problem that the wellfounded model of the original program does ..."
Abstract
 Add to MetaCart
An alternating fixpoint tailored to magic programs * We study applying the magicsets transformation technique to Datalog programs with negation that may not have 2valued wellfounded models. In this general setting we encounter the problem that the wellfounded model of the original program
The Alternating Fixpoint of Logic Programs with Negation
, 1995
"... The alternating fixpoint of a logic program with negation is defined constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least fixpoint is reached, using a transformation related to the one that defines stable models. From a fixed set of negative ..."
Abstract

Cited by 244 (3 self)
 Add to MetaCart
The alternating fixpoint of a logic program with negation is defined constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least fixpoint is reached, using a transformation related to the one that defines stable models. From a fixed set of negative
The Differential Fixpoint of General Logic Programs
 Proc. of the Workshop DDLP'96 on Deductive Databases and Logic Programming. 4th Workshop in conjunction with JICSLP'96
, 1996
"... We present a version of the alternating fixpoint procedure that is fully incremental. Using ideas of partial evaluation techniques we can compute the wellfounded model of logic programs with negation bottomup without any recomputations. Further extensions of the semantics, e.g. to stable models or ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We present a version of the alternating fixpoint procedure that is fully incremental. Using ideas of partial evaluation techniques we can compute the wellfounded model of logic programs with negation bottomup without any recomputations. Further extensions of the semantics, e.g. to stable models
by alternating fixpoints: Preliminary Report
"... Preferred wellfounded semantics for logic programming ..."
Alternating fixpoint theory for logic programs with priority
 In CL
, 2000
"... Abstract. van Gelder's alternating fixpoint theory has proven to be a very useful tool for unifying and characterizing various semantics for logic programs without priority. In this paper we propose an extension of van Gelder's alternating fixpoint theory and show that it can be used as a ..."
Abstract

Cited by 32 (6 self)
 Add to MetaCart
Abstract. van Gelder's alternating fixpoint theory has proven to be a very useful tool for unifying and characterizing various semantics for logic programs without priority. In this paper we propose an extension of van Gelder's alternating fixpoint theory and show that it can be used as a
Fairplay — a secure twoparty computation system
 In USENIX Security Symposium
, 2004
"... Advances in modern cryptography coupled with rapid growth in processing and communication speeds make secure twoparty computation a realistic paradigm. Yet, thus far, interest in this paradigm has remained mostly theoretical. This paper introduces Fairplay [28], a fullfledged system that implements ..."
Abstract

Cited by 229 (6 self)
 Add to MetaCart
that implements generic secure function evaluation (SFE). Fairplay comprises a high level procedural definition language called SFDL tailored to the SFE paradigm; a compiler of SFDL into a onepass Boolean circuit presented in a language called SHDL; and Bob/Alice programs that evaluate the SHDL circuit
Improving the Alternating Fixpoint: The Transformation Approach
, 1997
"... . We present a bottomup algorithm for the computation of the wellfounded model of nondisjunctive logic programs which is based on the set of elementary program transformations studied by Brass and Dix [4, 5]. The transformation approach has been introduced in more detail in [7]. In this paper we ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
we present a deeper analysis of its complexity and describe an optimized SCCoriented evaluation. We show that by our method no more work is done than by the alternating fixpoint procedure [23, 24] and that there are examples where our algorithm is significantly superior. 1 Introduction It is likely
The Alternating Fixpoint of Logic Programs with Negation \Lambda
, 1995
"... The principal contributions of this work are (1) that the alternating fixpoint partial model is identical to the wellfounded partial model, and (2) that alternating fixpoint logic is at least as expressive as fixpoint logic on all structures. Also, on finite structures, fixpoint logic is as express ..."
Abstract
 Add to MetaCart
The principal contributions of this work are (1) that the alternating fixpoint partial model is identical to the wellfounded partial model, and (2) that alternating fixpoint logic is at least as expressive as fixpoint logic on all structures. Also, on finite structures, fixpoint logic
Query Evaluation in Deductive Databases with Alternating Fixpoint Semantics
 ACM TRANSACTIONS ON DATABASE SYSTEMS
, 1995
"... Firstorder formulas allow natural descriptions of queries and rules. Van Gelder's alternating fixpoint semantics extends the wellfounded semantics of normal logic programs to general logic programs with arbitrary firstorder formulas in rule bodies. However, an implementation of general logic ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Firstorder formulas allow natural descriptions of queries and rules. Van Gelder's alternating fixpoint semantics extends the wellfounded semantics of normal logic programs to general logic programs with arbitrary firstorder formulas in rule bodies. However, an implementation of general
Results 1  10
of
243