Ordered completion for logic programs with aggregates

DOI10.1016/J.ARTINT.2015.03.007zbMATH Open1343.68043OpenAlexW2169055058MaRDI QIDQ892233FDOQ892233

N. E. Zubov

Publication date: 18 November 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2015.03.007

Recommendations

• Ordered completion for first-order logic programs on finite structures
• Properties and applications of programs with monotone and convex constraints
• Well-founded and stable semantics of logic programs with aggregates
• Semantics and complexity of recursive aggregates in answer set programming
• Logic Programming and Nonmonotonic Reasoning

zbMATH Keywords

answer set programmingfirst-order logicknowledge representationreasoninglogic programmingaggregates

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Cites Work

• Extending and implementing the stable model semantics
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Modular Nonmonotonic Logic Programming Revisited
• Semantics and complexity of recursive aggregates in answer set programming
• Logic programs with stable model semantics as a constraint programming paradigm
• Well-founded and stable semantics of logic programs with aggregates
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stable models and circumscription
• A Constructive semantic characterization of aggregates in answer set programming
• Design and implementation of aggregate functions in the DLV system
• Ordered completion for first-order logic programs on finite structures
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• On Reductive Semantics of Aggregates in Answer Set Programming
• Title not available (Why is that?)
• Logic programs with propositional connectives and aggregates
• Logic for Programming, Artificial Intelligence, and Reasoning
• The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
• On the Complexity of Answer Set Programming with Aggregates

Cited In (5)

• Title not available (Why is that?)
• Paracoherent answer set computation
• A progression semantics for first-order logic programs
• First-order stable model semantics with intensional functions
• Determining inference semantics for disjunctive logic programs

Uses Software

• Datalog

This page was built for publication: Ordered completion for logic programs with aggregates

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