Answer sets for logic programs with arbitrary abstract constraint atoms
From MaRDI portal
Recommendations
- Logic programs with abstract constraint atoms: the role of computations
- Logic Programs with Abstract Constraint Atoms: The Role of Computations
- A Default Approach to Semantics of Logic Programs with Constraint Atoms
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities
Cited in
(32)- A characterization of answer sets for logic programs
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities
- Sampler programs: the stable model semantics of abstract constraint programs revisited
- Argumentation-based semantics for logic programs with first-order formulae
- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +
- Semantics and complexity of recursive aggregates in answer set programming
- Set abstraction - an extension of all solutions predicate in logic programming language
- Logic programs with abstract constraint atoms: the role of computations
- \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
- Evaluating epistemic negation in answer set programming
- scientific article; zbMATH DE number 6747884 (Why is no real title available?)
- scientific article; zbMATH DE number 6261542 (Why is no real title available?)
- Abstraction for non-ground answer set programs
- Disjunctive Programs with Set Constraints
- scientific article; zbMATH DE number 5176700 (Why is no real title available?)
- scientific article; zbMATH DE number 7047282 (Why is no real title available?)
- Witnesses for Answer Sets of Logic Programs
- A Default Approach to Semantics of Logic Programs with Constraint Atoms
- Recursive rules with aggregation: a simple unified semantics
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Extensions of answer set programming
- Ordered completion for logic programs with aggregates
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- The loop formula based semantics of description logic programs
- Lparse Programs Revisited: Semantics and Representation of Aggregates
- Logic Programs with Abstract Constraint Atoms: The Role of Computations
- FLP answer set semantics without circular justifications for general logic programs
- Determining inference semantics for disjunctive logic programs
- Chain answer sets for logic programs with generalized atoms
- Well-supported semantics for logic programs with generalized rules
- Supportedly stable answer sets for logic programs with generalized atoms
This page was built for publication: Answer sets for logic programs with arbitrary abstract constraint atoms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624081)
