Pages that link to "Item:Q3432854"

The following pages link to Well-founded and stable semantics of logic programs with aggregates (Q3432854):

Displaying 43 items.

• Evaluating epistemic negation in answer set programming (Q286399) (← links)
• Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
• Loop-separable programs and their first-order definability (Q543631) (← links)
• Grounded fixpoints and their applications in knowledge representation (Q892232) (← links)
• Ordered completion for logic programs with aggregates (Q892233) (← links)
• Recursive rules with aggregation: a simple unified semantics (Q2151406) (← links)
• Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
• Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
• Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
• FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
• Flexible Approximators for Approximating Fixpoint Theory (Q2814522) (← links)
• Relating weight constraint and aggregate programs: Semantics and representation (Q2845120) (← links)
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs (Q2900518) (← links)
• Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms (Q3183130) (← links)
• A Formal Theory of Justifications (Q3449209) (← links)
• Shared aggregate sets in answer set programming (Q4559794) (← links)
• Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates (Q4559801) (← links)
• Scaling-up reasoning and advanced analytics on BigData (Q4559832) (← links)
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates (Q4592728) (← links)
• Knowledge compilation of logic programs using approximation fixpoint theory (Q4592990) (← links)
• Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
• Complexity and compilation of GZ-aggregates in answer set programming (Q4592998) (← links)
• Semantics of templates in a compositional framework for building logics (Q4593008) (← links)
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
• The KB paradigm and its application to interactive configuration (Q4593081) (← links)
• ASP-Core-2 Input Language Format (Q4957196) (← links)
• selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
• Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + (Q4957223) (← links)
• Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
• (Q5020979) (← links)
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (Q5038459) (← links)
• On Nested Justification Systems (Q5038468) (← links)
• Enhancing Magic Sets with an Application to Ontological Reasoning (Q5108494) (← links)
• Inconsistency Proofs for ASP: The ASP - DRUPE Format (Q5108508) (← links)
• A compositional typed higher-order logic with definitions (Q5240216) (← links)
• Lparse Programs Revisited: Semantics and Representation of Aggregates (Q5504666) (← links)
• Gelfond-Zhang aggregates as propositional formulas (Q5919599) (← links)
• Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT (Q6063882) (← links)
• On acceptance conditions in abstract argumentation frameworks (Q6494661) (← links)
• Categorical approximation fixpoint theory (Q6545560) (← links)
• Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming (Q6566627) (← links)
• Fixpoint semantics for recursive \textsc{shacl} (Q6647306) (← links)