Lifted Reasoning for Combinatorial Counting

DOI10.1613/JAIR.1.14062MaRDI QIDQ5870533OpenAlexFDO

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

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

constraint programmingautomated reasoningproblem solving

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Mathematics, word problems, common sense, and artificial intelligence
• Revisiting counting solutions for the global cardinality constraint
• Semiring programming: a semantic framework for generalized sum product problems
• Automatic conjecturing of P-recursions using lifted inference
• scientific article; zbMATH DE number 2119189

Cites work

• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• A comparison of structural CSP decomposition methods
• Algebraic model counting
• Clingo
• Essence: A constraint language for specifying combinatorial problems
• Handbook of constraint programming.
• The Semantics of Predicate Logic as a Programming Language
• The complexity of computing the permanent
• The complexity of the counting constraint satisfaction problem
• The computational complexity of probabilistic inference using Bayesian belief networks
• The design of the zinc modelling language
• Weighted first-order model counting in the two-variable fragment with counting quantifiers
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• sharpSAT

Cited in

(1)

• Mathematics, word problems, common sense, and artificial intelligence

Describes a project that uses

Uses Software

• MiniZinc
• Clingo
• MINION
• sharpSAT
• Essence

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

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