Co-occurring keywords · papers mentioning both
Papers
Structure-Aware Encodings of Argumentation Properties for Clique-width
AAAI 2026
Computing Twin-width with SAT and Branch & Bound
IJCAI 2023
Efficient Extraction of EL-Ontology Deductive Modules
AAAI 2023
Formally Verified SAT-Based AI Planning
AAAI 2023
Optimal Decision Trees For Interpretable Clustering with Constraints
IJCAI 2023
SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract)
IJCAI 2023
Efficient Encoding of Cost Optimal Delete-Free Planning as SAT
AAAI 2022
Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination
AAAI 2022
Computing Optimal Hypertree Decompositions with SAT
IJCAI 2021
Finding the Hardest Formulas for Resolution (Extended Abstract)
IJCAI 2021
SAT-based Decision Tree Learning for Large Data Sets
AAAI 2021
Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-Based HTN Planning
AAAI 2019
A SAT Approach to Branchwidth
IJCAI 2017