Explore chapters and articles related to this topic
Rule Languages
Published in Umberto Straccia, Foundations of Fuzzy Logic and Semantic Web Languages, 2016
To start with, we use the usual relation “directly depends on” among relation symbols, i.e., given 𝒦, we say that relation symbol p directly depends on relation symbol q if there is a rule in 𝒦 such that p occurs in the head of it and q occurs in the body of it. The relation depends on is the transitive closure of “directly depends on”. The dependency graph of 𝒦 is a directed graph where nodes are relation symbols and the set of edges is the “directly depends on” relation. The KB is recursive if there is a cycle in the dependency graph (i.e., there is p depending on p).
Modelling last-act attempted crime in criminal law
Published in Journal of Applied Non-Classical Logics, 2019
Jiraporn Pooksook, Phan Minh Dung, Ken Satoh, Giovanni Sartor
The dependency graph of an ABA framework M = () is a directed graph where nodes are sentences in , edges could be either negative or positive, and there exists a positive edge labelled by a rule r from a node α to a node δ iff α is a head of r and δ is an element of the body of r, andthere is a negative edge from a node α to a node δ iff .10
Scheduling Interdependent Smart Appliances with Mixed-Preemption Policy for Peak Load Minimization
Published in IETE Journal of Research, 2020
Nilotpal Chakraborty, Arijit Mondal, Samrat Mondal
For the set of deferrable appliances, the proposed algorithm constructs a dependency graph. For each of the deferrable appliances, the proposed algorithm obtains all the deferrable appliances on which it depends, and only those appliances are considered to construct the dependency graph. Once this dependency graph is obtained, the proposed algorithm looks for a cycle in it since the presence of a cycle indicates deadlock, in which case the specifications would be infeasible, and the algorithm halts there itself. Thus, we desire to obtain a cycle free dependency graph out of the appliance specifications.