Fusing First-Order Knowledge Compilation and the Lifted Junction Tree Algorithm

DOI10.1007/978-3-030-00111-7_3MaRDI QIDQ6488077zbMATH OpenWikidataFDO

Authors Tanya Braun, Ralf Möller

Publication date 24 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-00111-7_3

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1761425
• Publication:3493324
• scientific article; zbMATH DE number 913546
• scientific article; zbMATH DE number 569773
• Knowledge trees in complex knowledge bases
• Merging First-Order Knowledge Using Dilation Operators
• A decidable first-order logic for knowledge representation
• A decidable first-order logic for knowledge representation
• A practical integration of first-order reasoning and decision procedures

Cited in

(4)

• Counting and conjunctive queries in the lifted junction tree algorithm
• Preventing groundings and handling evidence in the lifted junction tree algorithm
• Lifted temporal most probable explanation
• Towards Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm

This page was built for publication: Fusing First-Order Knowledge Compilation and the Lifted Junction Tree Algorithm

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