Lifted Reasoning for Combinatorial Counting
From MaRDI portal
Publication:5870533
DOI10.1613/JAIR.1.14062OpenAlexW4313642913MaRDI QIDQ5870533FDOQ5870533
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
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
- Clingo
- sharpSAT
- Essence: A constraint language for specifying combinatorial problems
- Title not available (Why is that?)
- Handbook of constraint programming.
- The complexity of computing the permanent
- The complexity of the counting constraint satisfaction problem
- A comparison of structural CSP decomposition methods
- The Semantics of Predicate Logic as a Programming Language
- The design of the zinc modelling language
- The computational complexity of probabilistic inference using Bayesian belief networks
- Algebraic model counting
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Weighted first-order model counting in the two-variable fragment with counting quantifiers
Cited In (1)
Uses Software
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)
