Unified decomposition-aggregation (UDA) rules: dynamic, schematic, novel axioms

DOI10.1007/978-3-031-16681-5_15OpenAlexW4296050265MaRDI QIDQ6160565

Alan Bundy, Kwabena Nuamah

Publication date: 2 June 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/20.500.11820/fb9c7a2e-de30-42ed-a900-c7549c798344

zbMATH Keywords

query answeringhybrid reasoningUDA rules

Mathematics Subject Classification ID

Computer science support for mathematical research and practice (68Vxx)

Cites Work

• Unnamed Item
• Probabilistic logic
• Inference and learning in probabilistic logic programs using weighted Boolean formulas

This page was built for publication: Unified decomposition-aggregation (UDA) rules: dynamic, schematic, novel axioms