Vicious circle principle, aggregates, and formation of sets in ASP based languages
From MaRDI portal
Publication:2321320
DOI10.1016/J.ARTINT.2019.04.004zbMATH Open1478.68041OpenAlexW2942176634WikidataQ127977377 ScholiaQ127977377MaRDI QIDQ2321320FDOQ2321320
Yuanlin Zhang, Michael Gelfond
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2019.04.004
Cites Work
- Abstract gringo
- ASSAT: computing answer sets of a logic program by SAT solvers
- Extending and implementing the stable model semantics
- On the computational cost of disjunctive logic programming: Propositional case
- Nested expressions in logic programs
- Title not available (Why is that?)
- Weight constraints as nested expressions
- The DLV system for knowledge representation and reasoning
- Semantics and complexity of recursive aggregates in answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
- Conflict-driven answer set solving: from theory to practice
- FLP answer set semantics without circular justifications for general logic programs
- Extending the Smodels system with cardinality and weight constraints
- New Semantics for Epistemic Specifications
- Well-founded and stable semantics of logic programs with aggregates
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conflict-Driven Answer Set Enumeration
- Probabilistic reasoning with answer sets
- A Constructive semantic characterization of aggregates in answer set programming
- Design and implementation of aggregate functions in the DLV system
- Logic programming and knowledge representation
- Logics in Artificial Intelligence
- Approximating operators and semantics for abstract dialectical frameworks
- Relating Two Dialects of Answer Set Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logic Programming and Nonmonotonic Reasoning
- Monotonic aggregation in deductive databases
- On Reductive Semantics of Aggregates in Answer Set Programming
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
- Logic programs with propositional connectives and aggregates
- Logic Programming
- Vicious Circle Principle and Logic Programs with Aggregates
- Grounded fixpoints and their applications in knowledge representation
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- Logic programs with abstract constraint atoms: the role of computations
- Title not available (Why is that?)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts
- Gelfond-Zhang aggregates as propositional formulas
- Vicious circle principle and formation of sets in ASP based languages
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Complexity and compilation of GZ-aggregates in answer set programming
- Strong Equivalence of Logic Programs with Abstract Constraint Atoms
- Multi-level Algorithm Selection for ASP
Cited In (6)
- Look-back techniques for ASP programs with aggregates
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Recursive rules with aggregation: a simple unified semantics
- On Nested Justification Systems
- Strong Equivalence of Logic Programs with Counting
- On acceptance conditions in abstract argumentation frameworks
Uses Software
This page was built for publication: Vicious circle principle, aggregates, and formation of sets in ASP based languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321320)
