Lifted Reasoning for Combinatorial Counting

DOI10.1613/jair.1.14062OpenAlexW4313642913MaRDI QIDQ5870533

Pietro Totis, Jesse Davis, Angelika Kimmig, Luc De Raedt

Publication date: 9 January 2023

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.14062

zbMATH Keywords

automated reasoningproblem solvingconstraint programming

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Uses Software

• MiniZinc
• Clingo
• MINION
• sharpSAT
• Essence

Cites Work

• Unnamed Item
• Unnamed Item
• Clingo
• sharpSAT
• The complexity of computing the permanent
• The design of the zinc modelling language
• Essence: A constraint language for specifying combinatorial problems
• A comparison of structural CSP decomposition methods
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• Algebraic model counting
• The computational complexity of probabilistic inference using Bayesian belief networks
• The Semantics of Predicate Logic as a Programming Language
• Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers
• The complexity of the counting constraint satisfaction problem

This page was built for publication: Lifted Reasoning for Combinatorial Counting