Automatic conjecturing of P-recursions using lifted inference

DOI10.1007/978-3-030-97454-1_2MaRDI QIDQ6166545zbMATH OpenOpenAlexFDO

Authors Jáchym Barvínek, Timothy van Bremen, Yuyi Wang, Filip Železný, Ondřej Kuželka

Publication date 3 August 2023

Published in Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-97454-1_2

zbMATH Keywords

conjectureslifted inferenceweighted model counting

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Model theory of finite structures (03C13) Logic in artificial intelligence (68T27)

Recommendations

• Generalized counting for lifted variable elimination
• Counting and conjunctive queries in the lifted junction tree algorithm
• Inference in probabilistic logic programs using lifted explanations
• Lifted variable elimination: decoupling the operators from the constraint language

Cites work

• Analytic combinatorics
• Automated conjecture making in number theory using HR, Otter and Maple
• Guessing linear recurrence relations of sequence tuplesand P-recursive sequences with linear algebra
• On the Decision Problem for Two-Variable First-Order Logic
• Weighted first-order model counting in the two-variable fragment with counting quantifiers
• Weighted model counting beyond two-variable logic

Cited in

(1)

• Lifted Reasoning for Combinatorial Counting

This page was built for publication: Automatic conjecturing of P-recursions using lifted inference

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