Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models

DOI10.1007/978-3-540-85776-1_20MaRDI QIDQ3534663zbMATH OpenOpenAlexFDO

Authors Roman Bartak, Ondřej Čepek

Publication date 4 November 2008

Published in Artificial Intelligence: Methodology, Systems, and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85776-1_20

zbMATH Keywords

alternativescomplexityconstraint modelstemporal networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Discovering implied constraints in precedence graphs with alternatives
• scientific article; zbMATH DE number 6377994
• Temporal Reasoning in Nested Temporal Networks with Alternatives
• A formal definition of hierarchical predicate transition nets
• Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
• Precedence-inclusion patterns and relational learning
• From pattern invocation networks to rule preconditions
• scientific article; zbMATH DE number 4035160
• Conditional preference nets and possibilistic logic

Cites work

• Constraint-directed techniques for scheduling alternative activities
• CTP: A new constraint-based formalism for conditional, temporal planning
• On the Desirability of Acyclic Database Schemes

Cited in

(3)

• Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
• Temporal Reasoning in Nested Temporal Networks with Alternatives
• Discovering implied constraints in precedence graphs with alternatives

This page was built for publication: Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models

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