Mining CSTNUDs significant for a set of traces is polynomial

DOI10.1016/J.IC.2021.104773MaRDI QIDQ2051798zbMATH OpenOpenAlexFDO

Authors Guido Sciavicco, Matteo Zavatteri, Tiziano Villa

Publication date 25 November 2021

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2021.104773

zbMATH Keywords

CSTNUDmining temporal constraintssignificant temporal networkuncertainty

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Mining Significant Temporal Networks Is Polynomial
• Exhaustive search methods for CNS polynomials
• Measures on Boolean polynomials and their applications in data mining
• An efficient algorithm for computing causal trace sets in causality checking
• Perfect hashing schemes for mining traversal patterns
• On generalizing trace minimization principles
• A polynomial time recognition algorithm for probe interval graphs
• Euro-Par 2004 Parallel Processing
• Efficient mining of traversal patterns
• Inductive Logic Programming

Cites work

• A streamlined model of conditional simple temporal networks -- semantics and equivalence results
• Conditional simple temporal networks with uncertainty and decisions
• Conditional simple temporal networks with uncertainty and decisions
• Conditional Simple Temporal Networks with Uncertainty and Resources
• Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way
• CTP: A new constraint-based formalism for conditional, temporal planning
• Drake: an efficient executive for temporal plans with choice
• Dynamic controllability via timed game automata
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Hybrid SAT-based consistency checking algorithms for simple temporal networks with decisions
• Temporal constraint networks

This page was built for publication: Mining CSTNUDs significant for a set of traces is polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051798)