The following pages link to (Q3624081):
Displayed 16 items.
- Evaluating epistemic negation in answer set programming (Q286399) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- The loop formula based semantics of description logic programs (Q764312) (← links)
- Ordered completion for logic programs with aggregates (Q892233) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← 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)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Disjunctive Programs with Set Constraints (Q2900542) (← links)
- Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
- Argumentation-Based Semantics for Logic Programs with First-Order Formulae (Q4571139) (← links)
- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + (Q4957223) (← links)
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (Q5038459) (← links)
- ASP (): Answer Set Programming with Algebraic Constraints (Q5140023) (← links)
- Lparse Programs Revisited: Semantics and Representation of Aggregates (Q5504666) (← links)