Semantics and complexity of recursive aggregates in answer set programming

This publication has 40 references indexed in Scilit:

• Well-founded and stable semantics of logic programs with aggregates
  Theory and Practice of Logic Programming, 2007
• A Constructive semantic characterization of aggregates in answer set programming
  Theory and Practice of Logic Programming, 2007
• The DLV system for knowledge representation and reasoning
  ACM Transactions on Computational Logic, 2006
• Unfolding partiality and disjunctions in stable model semantics
  ACM Transactions on Computational Logic, 2006
• ASSAT: computing answer sets of a logic program by SAT solvers
  Artificial Intelligence, 2004
• Complexity and expressive power of logic programming
  ACM Computing Surveys, 2001
• Succinctness as a source of complexity in logical formalisms
  Annals of Pure and Applied Logic, 1999
• Monotonic Aggregation in Deductive Databases
  Journal of Computer and System Sciences, 1997
• Autoepistemic logic
  Journal of the ACM, 1991
• Circumscription—A form of non-monotonic reasoning
  Artificial Intelligence, 1980