Lifted Reasoning for Combinatorial Counting

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

zbMATH Keywords

constraint programmingautomated reasoningproblem solving

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

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

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)