Weighted Lars for quantitative stream reasoning

DOI10.3233/FAIA200160MaRDI QIDQ4999274zbMATH OpenFDO

Authors Thomas Eiter, Rafael Kiesel

Publication date 6 July 2021

Full work available at URL https://doi.org/10.3233/FAIA200160

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Automata and formal grammars in connection with logical questions (03D05) Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• LARS: a logic-based framework for analytic reasoning over streams
• LARS: a logic-based framework for analytic reasoning over streams (extended abstract)
• Fixed point semantics for stream reasoning
• A distributed approach to LARS stream reasoning (system paper)
• \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints

Cited in

(6)

• Aspmc: new frontiers of algebraic answer set counting
• LARS: a logic-based framework for analytic reasoning over streams
• Fixed point semantics for stream reasoning
• A distributed approach to LARS stream reasoning (system paper)
• LARS: a logic-based framework for analytic reasoning over streams (extended abstract)
• Reasoning on multirelational contextual hierarchies via answer set programming with algebraic measures

This page was built for publication: Weighted Lars for quantitative stream reasoning

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