A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Filters
Searching for Meaningful Feature Interactions with Backward-Chaining Rule Induction
[chapter]
2005
Lecture Notes in Computer Science
We propose Backward-Chaining Rule Induction (BCRI) as a semi-supervised mechanism for biasing the search for plausible feature interactions. ...
BCRI adds to a relatively limited tool-chest of hypothesis generation software, and it can be viewed as an alternative to purely unsupervised association rule learning. ...
Backward-Chaining Rule Induction (BCRI) To summarize, the initial step of BCRI builds decision rules for predicting a userspecified class or outcome. ...
doi:10.1007/11552253_9
fatcat:kfi3zcg7qrfyfpi7ohljswmg6u
Data mining for gene networks relevant to poor prognosis in lung cancer via backward-chaining rule induction
2007
Cancer Informatics
We use Backward Chaining Rule Induction (BCRI), a novel data mining method for hypothesizing causative mechanisms, to mine lung cancer gene expression array data for mechanisms that could impact survival ...
"Chains" of rules are created by working backward from an initial condition (e.g. survival status). ...
Backward-Chaining Rule Induction repression of transcription. ...
pmid:19455237
pmcid:PMC2312096
fatcat:fqt3zagc4nefpgkfdw6tjr3uwq
On Combining Backward and Forward Chaining in Constraint Logic Programming
2014
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14
We address the problem of designing constraint logic languages that usefully combine backward and forward chaining in a sound and complete way. ...
Syntactically, this class corresponds to Constraint Handling Rules with disjunctions, but differ operationally by featuring set-based semantics instead of multiset-based ones; i.e., conjunction and disjunction ...
It appears these general operational semantics capture backward chaining when the rules are logically read backward (as implications from right to left) and forward chaining when the rules are logically ...
doi:10.1145/2643135.2643144
dblp:conf/ppdp/Haemmerle14
fatcat:t7yw5mbjbzdj7p44p3haz5yyni
A quantum calculus formulation of dynamic programming and ordered derivatives
2008
2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)
In particular, we prove that the chain rule for ordered derivatives, fundamental to backpropagation, is valid in quantum calculus. In doing this we have connected two major fields of research. ...
Our results include the standard dynamic programming induction algorithm which can be interpreted as the Hamilton-Jacobi-Bellman equation in the quantum calculus. ...
This algorithm is a form of backwards induction. ...
doi:10.1109/ijcnn.2008.4634327
dblp:conf/ijcnn/SeifferttW08
fatcat:qe2vzvg5hbglhcyrxcxawlg7lq
Sound and complete forward and backward chainings of graph rules
[chapter]
1996
Lecture Notes in Computer Science
This paper presents graph operations for processing conceptual graph rules in forward chaining and backward chaining. ...
Basic notions (cut points, pieces, compatible partitions, uni cation) for backward chaining are detailed. ...
The proof is done by induction on the number of rule applications building G in forward chaining. The induction hypothesis is the following. ...
doi:10.1007/3-540-61534-2_16
fatcat:z2xdibrgyndr5jwlnutgalotai
Hamilton–Jacobi–Bellman Equations and Approximate Dynamic Programming on Time Scales
2008
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)
Section III focuses on the Bellman's optimality principle and the dynamic programming backward induction algorithm. ...
The core backward induction algorithm of dynamic programming is extended from its traditional discrete case to all isolated time scales. ...
Principle of Induction on Time Scales A form of backward induction exists on time scales [18] . ...
doi:10.1109/tsmcb.2008.923532
pmid:18632378
fatcat:rhelzudtxjh5re27cefd7jbf7m
Neural-Symbolic Computing: An Effective Methodology for Principled Integration of Machine Learning and Reasoning
[article]
2019
arXiv
pre-print
Forward and Backward chaining Forward chaining and backward chaining are two popular inference techniques for logic programs and other logical systems. ...
TensorLog [6] implements backward chaining using neural networks as symbols. ...
arXiv:1905.06088v1
fatcat:gm4f3ncukrbevpd7nq5yr75ar4
A Dynamic Level-k Model in Sequential Games
2012
Social Science Research Network
The rule hierarchy is iteratively defined such that the level-k rule is a best-response to the level-(k − 1) rule and the level-∞ rule corresponds to backward induction. ...
The model captures two systematic violations of backward induction in centipede games, limited induction and repetition unraveling. ...
the level-k rule best-responds to the level-(k − 1) rule and the level-∞ rule corresponds to backward induction. ...
doi:10.2139/ssrn.2127360
fatcat:df3x6ftyvvbafifmngagiy54gy
Introduction
2006
Intelligent Data Analysis
The article Backward Chaining Rule Induction by Fisher et al. introduces mechanisms based on backward chaining rule induction to bias the search of complex variable interactions. ...
doi:10.3233/ida-2006-10501
fatcat:bym6xgqdcrambor4ajoagja64q
Logical Rule Induction and Theory Learning Using Neural Theorem Proving
[article]
2018
arXiv
pre-print
Our approach is based on a novel neural forward-chaining differentiable rule induction network. The rules are interpretable and learned compositionally from their predicates, which may be invented. ...
We demonstrate the efficacy of our approach on a variety of ILP rule induction and domain theory learning datasets. ...
It is also possible to do backward chaining in which we start with a goal and work backwards by unifying it with the head of a rule, recursively trying to prove the body. ...
arXiv:1809.02193v3
fatcat:rgf5y54bcbfntj5drfwpelcgey
Gene expression meta-analysis supports existence of molecular apocrine breast cancer with a role for androgen receptor and implies interactions with ErbB family
2009
BMC Medical Genomics
LeFEminer and Backward Chaining Rule Induction support a role for AR signaling as a pathway that differentiates this subset from others. ...
We perform pathway analysis using LeFEminer and Backward Chaining Rule Induction to identify a signaling network that differentiates the subset. ...
Figure 5 Network 5 Inference Using Backward Chaining Rule Induction. The 17 genes discovered by the Backward Chaining Rule Induction strategy applied to the index cohorts. ...
doi:10.1186/1755-8794-2-59
pmid:19747394
pmcid:PMC2753593
fatcat:pntyzjjsunbvrizmszdeu6ouoe
Machine Checking Proof Theory: An Application of Logic to Logic
[chapter]
2008
Lecture Notes in Computer Science
Chaining
Operation: backward chaining on "propositions"
(like Prolog)
If sequent c is derivable from premises derivable from pms using rli using rli then c is derivable from pms using rli.Lemma ...
{pms 1 , 1 · · · , pms n } dersrec rli .. . .. .. . .. . .. . .. . .. . .. [ c, c 1 , · · · , c m ] Induction Principles are generated automatically by Isabelle from the inductive definition of derrec ...
doi:10.1007/978-3-540-92701-3_2
fatcat:336hqsm3r5ejjpgd6ijmejarti
Optimised Maintenance of Datalog Materialisations
[article]
2017
arXiv
pre-print
In contrast, the Counting algorithm does not evaluate the rules 'backwards', but it can handle only nonrecursive rules. ...
The Delete/Rederive (DRed) and the Backward/Forward (B/F) algorithms solve this problem for general datalog, but both contain steps that evaluate rules 'backwards' by matching their heads to a fact and ...
Still, there is room for improvement: backward chaining involves 'backward' evaluation of both nonrecursive and recursive rules, and we can use nonrecursive counters to eliminate the former. ...
arXiv:1711.03987v2
fatcat:vmnaueiuojdajn7tf2gxyghnnu
Deductive databases
1990
SIGMOD record
A salient feature of deductive databases is their capability of supporting a declarative, rule-based style of expressing queries and applications on databases. ...
(In rule (i) the first argument and the third one of allJol are bound, and these bindings propagate in the backward-chaining execution of the original allnnol rules.) ...
Some of the latter, such as OPSS, only support forward-chaining; others, such as Prolog, only support backward-chaining. ...
doi:10.1145/122058.122067
fatcat:5r4xfhndfbge5nzq4oqdllwgvu
A Dynamic Level-kModel in Sequential Games
2013
Management science
The rule hierarchy is iteratively defined such that the level-k rule is a best response to the level-k − 1 rule, and the level-rule corresponds to backward induction. ...
The model captures two systematic violations of backward induction in centipede games, limited induction and repetition unraveling. ...
Note that the latter behavioral rules are closer to backward induction than the former behavioral rules. ...
doi:10.1287/mnsc.1120.1645
fatcat:dc3hh24ihbeobgizbdvb4itfrq
« Previous
Showing results 1 — 15 out of 25,933 results