Results 1  10
of
53
Supporting Multiple Access Control Policies in Database Systems
 ACM Transactions on Database Systems
, 1996
"... Although there are several choices of policies for protection of information, access control models have been developed for a fixed set predefined access control policies that are then built into the corresponding access control mechanisms. This becomes a problem, however, if the access control req ..."
Abstract

Cited by 293 (44 self)
 Add to MetaCart
Although there are several choices of policies for protection of information, access control models have been developed for a fixed set predefined access control policies that are then built into the corresponding access control mechanisms. This becomes a problem, however, if the access control requirements of an application are different from the policies built into a mechanism. In most cases, the only solution is to enforce the requirements as part of the application code, but this makes verification, modification, and adequate enforcement of these policies impossible. In this paper, we propose a flexible authorization mechanism that can support different security policies. The mechanism enforces a general authorization model onto which multiple access control policies can be mapped. The model permits negative and positive authorizations, authorizations that must be strongly obeyed and authorizations that allow for exceptions, and enforces ownership together with delegation of admin...
Logic Programming and Negation: A Survey
 JOURNAL OF LOGIC PROGRAMMING
, 1994
"... We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them. ..."
Abstract

Cited by 280 (8 self)
 Add to MetaCart
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them.
Logic Programming and Knowledge Representation
 Journal of Logic Programming
, 1994
"... In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider exten sions of the language of definite logic programs by classical (strong) negation, disjunc tion, and some modal operators and sh ..."
Abstract

Cited by 242 (20 self)
 Add to MetaCart
In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider exten sions of the language of definite logic programs by classical (strong) negation, disjunc tion, and some modal operators and show how each of the added features extends the representational power of the language.
WellFounded Semantics Coincides with ThreeValued Stable Semantics
 FUNDAMENTA INFORMATICAE
, 1990
"... We introduce 3valued stable models which are a natural generalization of standard (2valued) stable models. We show that every logic program P has at least one 3valued stable model and that the wellfounded model of any program P [VGRS90] coincides with the smallest 3valued stable model of P. We c ..."
Abstract

Cited by 153 (15 self)
 Add to MetaCart
We introduce 3valued stable models which are a natural generalization of standard (2valued) stable models. We show that every logic program P has at least one 3valued stable model and that the wellfounded model of any program P [VGRS90] coincides with the smallest 3valued stable model of P. We conclude that the wellfounded semantics of an arbitrary logic program coincides with the 3valued stable model semantics. The 3valued stable semantics is closely related to nonmonotonic formalisms in AI. Namely, every program P can be translated into a suitable autoepistemic (resp. default) theory P so that the 3valued stable semantics of P coincides with the (3valued) autoepistemic (resp. default) semantics of P . Similar results hold for circumscription and CWA. Moreover, it can be shown that the 3valued stable semantics has a natural extension to the class of all disjunctive logic programs and deductive databases. Finally,
Well Founded Semantics for Logic Programs with Explicit Negation
 EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1992
"... The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised [11 ..."
Abstract

Cited by 131 (54 self)
 Add to MetaCart
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised [11]. This relationship improves the crossfertilization between logic programs and default theories, since we generalize previous results concerning their relationship [3, 4, 7, 1, 2], and there is an increasing use of logic programming with explicit negation for nonmonotonic reasoning [7, 15, 16, 13, 23]. It also clarifies the meaning of logic programs combining both explicit negation and negation by default. In particular, it shows that explicit negation corresponds exactly to classical negation in the default theory, and elucidates the use of rules in logic programs. Like defaults, rules are unidirectional, so their contrapositives are not implicit; the rule connective, /, is not materi...
Dualities between Alternative Semantics for Logic Programming and Nonmonotonic Reasoning
 Journal of Automated Reasoning
, 1998
"... The GelfondLifschitz operator [GL88] associated with a logic program (and likewise the operator associated with default theories by Reiter) exhibits oscillating behavior. In the case of logic programs, there is always at least one finite, nonempty collection of Herbrand interpretations around whic ..."
Abstract

Cited by 93 (9 self)
 Add to MetaCart
(Show Context)
The GelfondLifschitz operator [GL88] associated with a logic program (and likewise the operator associated with default theories by Reiter) exhibits oscillating behavior. In the case of logic programs, there is always at least one finite, nonempty collection of Herbrand interpretations around which the GelfondLifschitz [GL88] operator "bounces around". The same phenomenon occurs with default logic when Reiter's operator \Gamma \Delta is considered. Based on this, a "stable class" semantics and "extension class" semantics was proposed in [BS90]. The main advantage of this semantics was that it was defined for all logic programs (and default theories), and that this definition was modelled using the standard operators existing in the literature such as Reiter's \Gamma \Delta operator. In this paper, our primary aim is to prove that there is a very interesting duality between stable class theory and the well founded semantics for logic programming. In the stable class semantics, class...
Logic and Databases: a 20 Year Retrospective
, 1996
"... . At a workshop held in Toulouse, France in 1977, Gallaire, Minker and Nicolas stated that logic and databases was a field in its own right (see [131]). This was the first time that this designation was made. The impetus for this started approximately twenty years ago in 1976 when I visited Gallaire ..."
Abstract

Cited by 58 (1 self)
 Add to MetaCart
. At a workshop held in Toulouse, France in 1977, Gallaire, Minker and Nicolas stated that logic and databases was a field in its own right (see [131]). This was the first time that this designation was made. The impetus for this started approximately twenty years ago in 1976 when I visited Gallaire and Nicolas in Toulouse, France, which culminated in a workshop held in Toulouse, France in 1977. It is appropriate, then to provide an assessment as to what has been achieved in the twenty years since the field started as a distinct discipline. In this retrospective I shall review developments that have taken place in the field, assess the contributions that have been made, consider the status of implementations of deductive databases and discuss the future of work in this area. 1 Introduction As described in [234], the use of logic and deduction in databases started in the late 1960s. Prominent among the developments was the work by Levien and Maron [202, 203, 199, 200, 201] and Kuhns [1...