Semantics and complexity of recursive aggregates in answer set programming
From MaRDI portal
Publication:543600
DOI10.1016/j.artint.2010.04.002zbMath1216.68263OpenAlexW2064864283MaRDI QIDQ543600
Wolfgang Faber, Gerald Pfeifer, Nicola Leone
Publication date: 17 June 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://eprints.hud.ac.uk/id/eprint/18492/1/aggr_final.pdf
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Logic programming (68N17)
Related Items (58)
Supportedly stable answer sets for logic programs with generalized atoms ⋮ Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ Strong Equivalence of Logic Programs with Counting ⋮ On Nested Justification Systems ⋮ Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition ⋮ Evaluating epistemic negation in answer set programming ⋮ Simulating Production Rules Using ACTHEX ⋮ Stepwise Debugging of Description-Logic Programs ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ Modular materialisation of Datalog programs ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ The complexity and generality of learning answer set programs ⋮ Exploiting Unfounded Sets for HEX-Program Evaluation ⋮ Shared aggregate sets in answer set programming ⋮ Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates ⋮ Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning ⋮ Scaling-up reasoning and advanced analytics on BigData ⋮ A framework for modular ERDF ontologies ⋮ Vicious Circle Principle and Logic Programs with Aggregates ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Ordered completion for logic programs with aggregates ⋮ Fixpoint semantics and optimization of recursive Datalog programs with aggregates ⋮ Rewriting recursive aggregates in answer set programming: back to monotonicity ⋮ Complexity and compilation of GZ-aggregates in answer set programming ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ Query answering in resource-based answer set semantics ⋮ The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description) ⋮ Enhancing Magic Sets with an Application to Ontological Reasoning ⋮ About Epistemic Negation and World Views in Epistemic Logic Programs ⋮ Inconsistency Proofs for ASP: The ASP - DRUPE Format ⋮ Relating Two Dialects of Answer Set Programming ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ Hybrid planning for challenging construction problems: an answer set programming approach ⋮ Rule Induction and Reasoning over Knowledge Graphs ⋮ Stepwise debugging of answer-set programs ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A compositional typed higher-order logic with definitions ⋮ Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More ⋮ Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints ⋮ ASP (): Answer Set Programming with Algebraic Constraints ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Conflict-driven ASP solving with external sources ⋮ Conflict-driven answer set solving: from theory to practice ⋮ John McCarthy's legacy ⋮ Answering the “why” in answer set programming – A survey of explanation approaches ⋮ Determining inference semantics for disjunctive logic programs ⋮ Inlining External Sources in Answer Set Programs ⋮ ASP-Core-2 Input Language Format ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ Fixed point semantics for stream reasoning ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ Gelfond-Zhang aggregates as propositional formulas ⋮ Complexity results for probabilistic answer set programming ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages ⋮ Domain expansion for ASP-programs with external sources
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotonic aggregation in deductive databases
- ASSAT: computing answer sets of a logic program by SAT solvers
- Semantical considerations on nonmonotonic logic
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Non-monotonic logic. I
- Succinctness as a source of complexity in logical formalisms
- Extending and implementing the stable model semantics
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programming and nonmonotonic reasoning. 5th international conference, LPNMR '99. El Paso, TX, USA, December 2--4, 1999. Proceedings
- Nested expressions in logic programs
- Well-founded and stable semantics of logic programs with aggregates
- A Constructive semantic characterization of aggregates in answer set programming
- Nonmonotonic Logic II
- Autoepistemic logic
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Weight constraints as nested expressions
- Unfolding partiality and disjunctions in stable model semantics
- The DLV system for knowledge representation and reasoning
- The nomore + + Approach to Answer Set Solving
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
This page was built for publication: Semantics and complexity of recursive aggregates in answer set programming
