this paper studies logic based methods for representing and evalulating complex access control policies needed by modern database applications. In our framework, authorization and delegation rules are specified in a, ...
详细信息
ISBN:
(纸本)9783642035722
this paper studies logic based methods for representing and evalulating complex access control policies needed by modern database applications. In our framework, authorization and delegation rules are specified in a, Weighted Delegatable Anthorization Program (WDAP) which is an extended logic program. We show how extended logic programs call be used to specify Complex security policies which support weighted administrative privilege delegation, weighted positive and negative authorizations, and weighted authorization propagations. We also propose a conflict resolution method that enables flexible delegation control by considering priorities of authorization grantors and weights of authorizations. A number of rules are provided to achieve delegation depth control, conflict resolution, and authorization and delegation propagations.
We propose a generalized version of context-sensitivity in term rewriting based on the notion of "forbidden patterns". the basic idea is that a rewrite step should be forbidden if the redex to be contracted ...
We propose a generalized version of context-sensitivity in term rewriting based on the notion of "forbidden patterns". the basic idea is that a rewrite step should be forbidden if the redex to be contracted has a certain shape and appears in a certain context. this shape and context is expressed through forbidden patterns. In particular we analyze the relationships among this novel approach and the commonly used notion of context-sensitivity in term rewriting, as well as the feasibility of rewriting with forbidden patterns from a computational point of view. the latter feasibility is characterized by demanding that restricting a rewrite relation yields an improved termination behaviour while still being powerful enough to compute meaningful results. Sufficient criteria for both kinds of properties in certain classes of rewrite systems with forbidden patterns are presented.
One of the major challenges in knowledge discovery is how to extract meaningful and useful knowledge from the complex structured data that one finds in Scientific and Technological applications. One approach is to exp...
详细信息
ISBN:
(纸本)9780769534404
One of the major challenges in knowledge discovery is how to extract meaningful and useful knowledge from the complex structured data that one finds in Scientific and Technological applications. One approach is to explore the logic relations in the database and using, say, an Inductive logicprogramming (ILP) algorithm find descriptive and expressive patterns. these patterns can then be used as features to characterize the target concept, the effectiveness of these algorithms depends both upon the algorithm we use to generate the patterns and upon the classifier Rule mining provides an excellent framework for efficiently mining the interesting patterns that are relevant. We propose a novel method to select discriminative patterns and evaluate the effectiveness of this method on a complex discovery application of practical interest.
ProbLog is a recently introduced probabilistic extension of Prolog (De Raedt, et al. in Proceedings of the 20thinternational joint conference on artificial intelligence, pp. 2468-2473, 2007). A ProbLog program define...
详细信息
ProbLog is a recently introduced probabilistic extension of Prolog (De Raedt, et al. in Proceedings of the 20thinternational joint conference on artificial intelligence, pp. 2468-2473, 2007). A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belongs to a randomly sampled program, and these probabilities are mutually independent. the semantics of ProbLog is then defined by the success probability of a query in a randomly sampled program. this paper introduces the theory compression task for ProbLog, which consists of selecting that subset of clauses of a given ProbLog program that maximizes the likelihood w.r.t. a set of positive and negative examples. Experiments in the context of discovering links in real biological networks demonstrate the practical applicability of the approach.
logicprogramming and the Prolog language have a major role in Computing. Prolog, and its derived languages, have been widely used in a impressive variety of application domains. thus, a bit of the history of logic Pr...
详细信息
Monitoring a patient in his home environment is necessary to ensure continuity of care in home settings, but this activity must not be too much invasive and a burden for clinicians. For this reason we proto-typed a sy...
详细信息
ISBN:
(纸本)9783540899815
Monitoring a patient in his home environment is necessary to ensure continuity of care in home settings, but this activity must not be too much invasive and a burden for clinicians. For this reason we proto-typed a system called SINDI (Secure and INDependent living), focused on i) collecting a limited amount of data about the person and the environment through Wireless Sensor Networks (WSN), and ii) reasoning about these data both to contextualize them and to support clinicians in understanding patients' well being as well as in predicting possible evolutions of their health. Our hierarchical logic-based model of health combines data from different sources, sensor data, tests results, commonsense knowledge and patient's clinical profile at the lower level, and correlation rules between aspects of health (items) across upper levels. the logical formalization and the reasoning process are based on Answer Set programming. the expressive power of this logicprogramming paradigm allows efficient reasoning to support prevention, while declarativity simplifies rules specification by clinicians and allows automatic encoding of knowledge. this paper describes how these issues have been targeted in the application scenario of the SINDI system.
As network-enabled devices and computerized services become ubiquitous in a breadth of applications, it is imperative that distributed system architectures enable components to communicate effectively and efficiently ...
详细信息
ISBN:
(纸本)9781627486620
As network-enabled devices and computerized services become ubiquitous in a breadth of applications, it is imperative that distributed system architectures enable components to communicate effectively and efficiently in heterogeneous environments. Standardized application-level network protocols are currently the most popular communication solution but a significant amount of flexibility is then lost at the network boundary. We propose an interaction model for distributed systems that will allow application knowledge in the form of programminglogic to be shared across platform and programming language boundaries. We define an XML-based meta-language for describing application logic which is not targeted toward any one specific programming language, environment, or machine stack (real or virtual). Distributed applications can use this specification to exchange logic such as the details of application-level protocols in heterogeneous environments at runtime. this removes the distributed system's dependency on standardized and generalized application-level protocols. Distributed systems can also exchange algorithmic solutions to specific problems (knowledge dissemination), removing the need for any network-based communications to a centralized server. these freedoms will ultimately enable a distributed system that is more efficient, scalable, and adaptable than the current state of the art.
ProbLog is a recently introduced probabilistic extension of Prolog (De Raedt, et al. in Proceedings of the 20thinternational joint conference on artificial intelligence, pp. 2468-2473, 2007). A ProbLog program define...
详细信息
ProbLog is a recently introduced probabilistic extension of Prolog (De Raedt, et al. in Proceedings of the 20thinternational joint conference on artificial intelligence, pp. 2468-2473, 2007). A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belongs to a randomly sampled program, and these probabilities are mutually independent. the semantics of ProbLog is then defined by the success probability of a query in a randomly sampled program. this paper introduces the theory compression task for ProbLog, which consists of selecting that subset of clauses of a given ProbLog program that maximizes the likelihood w.r.t. a set of positive and negative examples. Experiments in the context of discovering links in real biological networks demonstrate the practical applicability of the approach.
the proceedings contain 46 papers. the special focus in this conference is on Analysis, Constraints, Alternative Paradigms and Answer Set programming. the topics include: Answer set programming and the design of delib...
ISBN:
(纸本)3540226710
the proceedings contain 46 papers. the special focus in this conference is on Analysis, Constraints, Alternative Paradigms and Answer Set programming. the topics include: Answer set programming and the design of deliberative agents;abstract domains based on regular types;termination of logic programs using various dynamic selection rules;Smodels with CLP and its applications;a simple and effective approach to aggregates in asp;the refined operational semantics of constraint handling rules;constraint handling rules and tabled execution;possible worlds semantics for probabilistic logic programs;generalised kernel sets for inverse entailment;on programs with linearly ordered multiple preferences;simplifying logic programs under answer set semantics;on acyclic and head-cycle free nested logic programs;speculative computations in or-parallel tabled logic programs;implementation results in classical constructive negation;on hybridization of local search and constraint propagation;non-viability deductions in arc-consistency computation;compiling prioritized circumscription into answer set programming;enhancing the magic-set method for disjunctive datalog programs;rectilinear Steiner tree construction using answer set programming;adding domain dependent knowledge into answer set programs for planning;multi-agent coordination as distributed logicprogramming;logic programs with annotated disjunctions;abstract interpretation-based mobile code certification;logicprogramming languages for querying and evolution on the web;applying CLP to predict extra-functional properties of component-based models;development of semantic debuggers based on refinement calculus and a tracer driver to enable debugging, monitoring and visualization of CLP executions from a single tracer.
this paper is a preliminary report on the development of a "declarative" programming language SPL+. It assists non-technical people to write programs. the key idea behind SPL+ is that the "programmer&qu...
详细信息
this paper is a preliminary report on the development of a "declarative" programming language SPL+. It assists non-technical people to write programs. the key idea behind SPL+ is that the "programmer" only needs to solve target problems with a standardized methodology without worrying about how to solve the problem efficiently.
暂无评论