Lecture image placeholder

Premium content

Access to this content requires a subscription. You must be a premium user to view this content.

Monthly subscription - $9.99Pay per view - $4.99Access through your institutionLogin with Underline account
Need help?
Contact us
Lecture placeholder background
VIDEO DOI: https://doi.org/10.48448/n3xb-cq91

poster

AAAI 2023

February 10, 2023

Washington, United States

Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?

Please log in to leave a comment

Downloads

SlidesTranscript English (automatic)

Next from AAAI 2023

Minority-Oriented Vicinity Expansion with Attentive Aggregation for Video Long-Tailed Recognition
poster

Minority-Oriented Vicinity Expansion with Attentive Aggregation for Video Long-Tailed Recognition

AAAI 2023

Hyun Seok SeongJae-Pil HeoWonJun Moon
WonJun Moon and 2 other authors

10 February 2023

Similar lecture

Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity
poster

Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity

AAAI 2023

Stefan Szeider
Markus Hecher and 2 other authors

12 February 2023