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

DOI10.1007/978-3-031-16681-5_15MaRDI QIDQ6160565zbMATH OpenOpenAlexFDO

Authors 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

hybrid reasoningquery answeringUDA rules

Mathematics Subject Classification ID

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

Recommendations

• Recursive rules with aggregation: a simple unified semantics
• Recursive rules with aggregation: a simple unified semantics
• Uniform schemata for proof rules
• Intelligent query answering in rule based systems
• Rule Calculus: Semantics, Axioms and Applications

Cites work

• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Probabilistic logic
• Resolution theorem proving

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

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