scientific article
From MaRDI portal
Publication:3624081
zbMath1182.68044arXiv1110.2205MaRDI QIDQ3624081
Enrico Pontelli, Phan Huy Tu, Tran Cao Son
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1110.2205
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ Evaluating epistemic negation in answer set programming ⋮ Disjunctive Programs with Set Constraints ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ Argumentation-Based Semantics for Logic Programs with First-Order Formulae ⋮ Ordered completion for logic programs with aggregates ⋮ ASP (): Answer Set Programming with Algebraic Constraints ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Logic programs with abstract constraint atoms: the role of computations ⋮ Semantics and complexity of recursive aggregates in answer set programming ⋮ Determining inference semantics for disjunctive logic programs ⋮ Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + ⋮ The loop formula based semantics of description logic programs ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages ⋮ Lparse Programs Revisited: Semantics and Representation of Aggregates
This page was built for publication: