Well-founded and stable semantics of logic programs with aggregates

DOI10.1017/S1471068406002973zbMath1111.68070MaRDI QIDQ3432854

Maurice Bruynooghe, Nikolay Pelov, Marc Denecker

Publication date: 19 April 2007

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

logic programmingaggregates

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

Supportedly stable answer sets for logic programs with generalized atoms, Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory, On Nested Justification Systems, Evaluating epistemic negation in answer set programming, A Formal Theory of Justifications, Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs, Well-Supported Semantics for Logic Programs with Generalized Rules, Characterizations of stable model semantics for logic programs with arbitrary constraint atoms, Recursive rules with aggregation: a simple unified semantics, Shared aggregate sets in answer set programming, Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates, Scaling-up reasoning and advanced analytics on BigData, Grounded fixpoints and their applications in knowledge representation, Ordered completion for logic programs with aggregates, Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT, Fixpoint semantics and optimization of recursive Datalog programs with aggregates, Knowledge compilation of logic programs using approximation fixpoint theory, Rewriting recursive aggregates in answer set programming: back to monotonicity, Complexity and compilation of GZ-aggregates in answer set programming, Semantics of templates in a compositional framework for building logics, Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3, The KB paradigm and its application to interactive configuration, Enhancing Magic Sets with an Application to Ontological Reasoning, Inconsistency Proofs for ASP: The ASP - DRUPE Format, Unnamed Item, A compositional typed higher-order logic with definitions, FLP answer set semantics without circular justifications for general logic programs, Semantics and complexity of recursive aggregates in answer set programming, Loop-separable programs and their first-order definability, Determining inference semantics for disjunctive logic programs, ASP-Core-2 Input Language Format, selp: A Single-Shot Epistemic Logic Program Solver, Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +, Flexible Approximators for Approximating Fixpoint Theory, Gelfond-Zhang aggregates as propositional formulas, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Relating weight constraint and aggregate programs: Semantics and representation, Lparse Programs Revisited: Semantics and Representation of Aggregates