Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
propagation rules
Description:
Inference rules that derive further constraints or facts from existing ones, used in logic programming, constraint solving, and coding theory.
Related topics:
Coding theory and cryptography (17%),
Logic, programming, and type systems (9%),
Constraint Satisfaction and Optimization (8%)
OpenAlex ID:
keywords/propagation-rules
Layer-Wise Relevance Propagation: An Overview
2019
·
Grégoire Montavon
, Alexander Binder
, et al.
·
Lecture notes in computer science
·
1,106
Commonsense reasoning about causality: Deriving behavior from structure
1984
·
Benjamin Kuipers
·
Artificial Intelligence
·
577
Navigation of brain networks
2018
·
Caio Seguin
, Martijn P. van den Heuvel
, et al.
·
Proceedings of the National Academy of Sciences
·
186
PDF
Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes
2022
·
Markus Grassl
, Felix Huber
, et al.
·
IEEE Transactions on Information Theory
·
103
PDF
Supporting impact analysis and change propagation in software engineering environments
2002
·
J. Han
·
International Workshop on Computer-Aided Software Engineering (CASE)
·
71
Note on Niederreiter-Xing's Propagation Rule for Linear Codes
2002
·
Ferruh Özbudak
, Henning Stichtenoth
·
Applicable Algebra in Engineering Communication and Computing
·
69
Some New Constructions of Quantum MDS Codes
2019
·
Weijun Fang
, Fang-Wei Fu
·
IEEE Transactions on Information Theory
·
66
PDF
Modal Tableaux with Propagation Rules and Structural Rules
1997
·
Marcos A. Castilho
, Luis Fariñas del Cerro
, et al.
·
Fundamenta Informaticae
·
64
Constructing quantum error-correcting codes that require a variable amount of entanglement
2023
·
Gaojun Luo
, Martianus Frederic Ezerman
, et al.
·
Quantum Information Processing
·
60
PDF
Particle Learning for Sequential Bayesian Computation*
2011
·
Hedibert F. Lopes
, Michael S. Johannes
, et al.
·
Oxford University Press eBooks
·
58
Domination in graphs with bounded propagation: algorithms, formulations and hardness results
2008
·
Ashkan Aazami
·
Journal of Combinatorial Optimization
·
58
PDF
MinT: A Database for Optimal Net Parameters
2006
·
Rudolf Schürer
, Wolfgang Ch. Schmid
·
Springer eBooks
·
54
Investigating feedforward neural networks with respect to the rejection of spurious patterns
1995
·
G.C. Vasconcelos
, M.C. Fairhurst
, et al.
·
Pattern Recognition Letters
·
50
The trousers problem revisited
1988
·
Corinne A Manogue
, Ed Copeland
, et al.
·
Pramana
·
44
A new efficient approach to the direct restricted active space self-consistent field method
2003
·
Michael Klene
, Michael A. Robb
, et al.
·
The Journal of Chemical Physics
·
36
Secure Manipulation of Linked Data
2013
·
Sabrina Kirrane
, Ahmed Abdelrahman
, et al.
·
Lecture notes in computer science
·
33
PDF
Component Specification Using Event Classes
2009
·
Mark Bickford
·
Lecture notes in computer science
·
33
Subsystem code constructions
2008
·
Salah A. Aly
, Andreas Klappenecker
·
IEEE International Symposium on Information Theory (ISIT)
·
31
PDF
An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
2024
·
Eduardo Camps-Moreno
, Hiram H. López
, et al.
·
Quantum Information Processing
·
28
PDF
Supporting impact analysis: a semi-automated technique and associated tool
2002
·
S. Barros
, T. Bodhuin
, et al.
·
IEEE International Conference on Software Maintenance (ICSM)
·
28
GPIVOT: Efficient Incremental Maintenance of Complex ROLAP Views
2005
·
Songting Chen
, E.A. Rundensteiner
·
IEEE International Conference on Data Engineering (ICDE)
·
26
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results
2017
·
Cairo, Massimo
, Hunsberger, Luke
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
23
PDF
Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics
2019
·
Tim Lyon
, Kees van Berkel
·
Lecture notes in computer science
·
21
PDF
Dedicated constraint propagation for Job-Shop problem with generic time-lags
2011
·
P. Lacomme
, N. Tchernev
, et al.
·
21
Nested Sequents for Intuitionistic Modal Logics via Structural Refinement
2021
·
Tim S. Lyon
·
Lecture notes in computer science
·
20
PDF
Show more works
View as search
Works count:
183
Citation count:
3,580
Year
Topic
Type